euler 10

by Hensixteen

JavaScript

var counter = 10;
var primeTest = 2;
var outCount = 1000;
var prime = false;
var sum = 17;

for(counter = 9; counter < 2000000; counter+=2) {

	prime = testForPrime();
  
  if(prime == true) {  
  	sum+=counter;
    outCount++;
    if(outCount >= 1000) {
    	console.log(sum + " - " + counter);
      outCount = 0;
    }
  }
  
  prime = false;

}

console.log(sum + " - " + (counter-1));

function testForPrime() {
	for(primeTest = 2; primeTest<counter; primeTest++) {  
  	if((counter%primeTest) == 0) {
    	return false;
    }
    else if(((counter%primeTest) != 0) && (primeTest>(counter/2))) {
    	return true
    }
  }
}