Description
Counting primes below ten billion with a homemade sieve can take minutes. primesieve uses a highly optimized, multithreaded sieve of Eratosthenes to count over 455 million primes below 1e10 in under 0.1 seconds.
It counts twin and other prime k-tuplets, prints primes in any range and ships as a C/C++ library.
Fast counting:Multithreaded.
k-tuplets:Twins, triplets and more.
Printing:Any range.
Library:C/C++ API.
It counts twin and other prime k-tuplets, prints primes in any range and ships as a C/C++ library.
Features
Fast counting:Multithreaded.
k-tuplets:Twins, triplets and more.
Printing:Any range.
Library:C/C++ API.
