Write a program that implements Sieve of Eratosthenes and outputs """"one single integer"""" at the end: the number of prime numbers <= n.

Compile your program as a static binary.

The output for n = 100,000,000 should be 5761455.