Sieve of Eratosthenes - generating prime numbers

JavaScript

function sieveOfEratosthenes(n) {
  var sieve = [],
      primes = [];
  var i, j;
  var sum = 2;


  for (i = 2; i * i <= n; i++) {
    if (sieve[i] === true) {
      continue;
    }

    for (j = i * i; j <= n; j += i) {
      sieve[j] = true;
    }
  }

  for(i = 3; i <= n; i+=2){
    if (sieve[i] !== true) {
      primes.push(i);
      sum += i;
    }
  }

  return sum;
}

console.log(sieveOfEratosthenes(1000000000));