Problem 10 of Find the sum of all the primes below two million.

public class BigPrime {
public static void main(String args[]){
long j=0;
for(long i=2;i<2000000;i++){
if(isPrime(i)){
j+=i;
}
}
System.out.println(j);
}

public static boolean isPrime(long n){
for(int i = 2; i * i <= n; i++){
if(n % i == 0)
return false;
}
return true;
}
}