Benchmark implementation with calling function being tested with constant argument provides unhelpful results (1-2 ns) when solution uses cache for yet found primes. This way is’s hard to define if code changing makes code faster / slower.
By calling function being tested over a range of argument values we force code to do some work.
Proposed alteration does NOT require revalidation of previously submitted solutions.