sum-all-prime..js

// from FCC

function sumPrimes(num) {

  var numberList = []
  for (var i = 2; i <= num; i++) {
    numberList.push(i)
  }
  
  let nonPrimes = []  
  for (var i = 0; i < numberList.length; i++) {
    var p = numberList[i]
    for (var j = p; j <= num; j+=p) {
      if (j % p === 0 && j !== p) {
        nonPrimes.push(j)
      }
    }
  }
   let primes = numberList.filter(x => !nonPrimes.includes(x))

   return primes.reduce((sum,prime) => sum + prime, 0)
   
}

sumPrimes(10);