3v4l.org

run code in 300+ PHP versions simultaneously

sponsor
bughunt
search
recent
about

@ 2015-09-17T08:42:27Z

<?php

$n = 2 * 1000 * 1000;

$primes = [];

for ($i = 2; $i < sqrt($n); $i++) {
	if (!isset($primes[$i])) {
		$primes[$i] = true;
		
		for ($j = 0; pow($i2, 2) + ($i*$j) < sqrt($n); $j++) {
			$primes[pow($i2, 2) + ($i*$j)] = false;
		}
	}
}

echo 'Sum of all primes below 2.000.000: ' . array_sum($primes);

Output
Performance
VLD
References
Branches

array_sum: documentation ( source)
pow: documentation ( source)
sqrt: documentation ( source)

preferences:dark modelive preview

65.8 ms | 402 KiB | 5 Q