Still, number 11 004 979 is orders of magnitude smaller than possible max. Testing for some close-to-max prime would be more reasonable test (well, assuming this kind of benchmark can be reasonable in general).

Wouldn't it be more dandy to summarise the top fastest solutions on the discourse page instead?

This code was checked number (prime) 11 004 979 in 30 000 nanoseconds

This code was checked number (prime) 11 004 979 in 111 500 nanoseconds

This code was checked number (prime) 11 004 979 in 5 770 000 nanoseconds

This code was checked number (prime) 11 004 979 in 206 400 nanoseconds

This code was checked number 2 000 000 000 in 40 000 nanoseconds

Why are you testing on the easiest numbers to check, instead on the difficult numbers?

This code was checked number 2 000 000 000 in 3 000 nanoseconds

This code was checked number 2 000 000 000 in 450 000 nanoseconds

This code was checked number 2 000 000 000 in 35 000 nanoseconds