Small (?) example

gistfile1.txt

# 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;

About 10% faster version, using .sum(:wrap): https://gist.github.com/lizmat/b05d32486b1d74a4b69fcea13fe4b9d8