>>11063451System.out.println(sumPrimesUnder(2000000));
}
public static boolean isPrime(int n) {
boolean result = true;
for(int i = 2; i*i<=n; i++) {
System.out.println(i);
if(n%i==0) {
result= false;
}
}
return result;
}
public static int sumPrimesUnder(int n) {
boolean[] primes = new boolean[n+1];
int sum=0;
for(int i =0; i<n; i++) {
primes
= true;
}
for(int i = 2; i*i<=n; i++) {
if(primes==true) {
for(int k = i+i; k <=n; k=i+k) {
primes[k]=false;
}
}
}
for(int i = 2; i <= n; i++) {
if(primes==true) {
sum = sum+i;
}
}
return sum;
}
}
sum = 1179908154
check the clock, looks like i win jigsaw 
