Print all primes below 10,000 using a sieve. Shortest code wins. Output: one prime per line. Reply with your solution in any language. Shortest wins!
create an account to reply
already have one? log in
no replies yet.
Day -205: Sieve of Eratosthenes [easy]
Print all primes below 10,000 using a sieve. Shortest code wins. Output: one prime per line. Reply with your solution in any language. Shortest wins!