Project Euler – Problem 50

Problem 50: Which prime, below one-million, can be written as the sum of the most consecutive primes?

class runner
	//true means composite
	public static int sieveArray(boolean[] arr){
		int numOfPrimes = 0;
		arr[0] = true; arr[1] = true;
		for(int i=2;i

Note: If using Vectors for the array "primes", the execution time will increase from 34s to 2.8minutes.