This repo contains the data, calculating the number of primes less than or equal to the input. Range 2 to 100 is used initially so that errors (if any) could be spotted easily. One large (reasonably) input is added in order to confirm that this behavior is reproducible not only for small input.

Raw output

math.txt is obtained from WolframAlpha

seq.txt is obtained from PrimeNaive.java

actor.txt is obtained from primesieves

actor2.txt and actor4.txt are similar to actor.txt, but use 2 and 4 actors (cores), respectively.

Large input

Only one test case is run manually:

PI(1000098) = 78503

./run.sh 1000098 => 78504

Comparison

compare.txt shows the comparison for all the output in one file, while diff.txt only captures the lines where output diverges.

Note

This PrimeNaive.java (the implementation we are using to get seq.txt) is actually different from PrimeNaive.java, even though a little. The latter one crashes for input 9, so it's not used in this comparison.

Reference

Prime Counting Function