test_millor_rabin.cpp

#include <bits/stdc++.h>
using namespace std;

#include "math/millor_rabin.cpp"

int main() {
	random_device rng;
	mt19937 mt(rng());
	uniform_int_distribution<long long> dist(1, 9000000000000000000ll);
	int k = 1000000; // num of loops
	chrono::system_clock::time_point s, t;
	int ans = 0;

	s = chrono::system_clock::now();
	while(k--) {
		long long n = dist(mt);
		if(isprime(n)) ans++;
	}
	t = chrono::system_clock::now();

	auto tm = chrono::duration_cast<chrono::milliseconds>(t - s).count();
	cout << ans << endl;
	cout << tm << "[ms]" << endl;
}