Created
March 19, 2018 18:28
-
-
Save dogbert17/b864cc4d0bb6b0d9cfcee8c85f0f76e3 to your computer and use it in GitHub Desktop.
Euler problem 10
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Find the sum of all the primes below two million. | |
use v6; | |
my int $max = 2_000_000; | |
# find all primes up to $max using The Sieve of Erathostenes | |
my int @a = (0..$max); | |
for (2..($max div 2)) -> int $i { | |
my int $j = 2; | |
@a[$i * $j++] = 1 while $i * $j <= $max; | |
} | |
# remove discarded numbers and store the rest in a set for ease of lookup | |
my @primes = @a.grep(-> int $num {$num > 1}); | |
say @primes.sum; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment