freeCodeCamp Challenge Guide: Sum All Primes

Guide
50

Hello everyone,

'Cause I didn’t saw something exactly like this, I think I’ll add my solution in the pool:

    function sumPrimes(num) {
      
      var temp = [],
          primes = [],
          sumUp;
      
      function zPrime(num) {
        for (var x = 2; x < num; x++) {
          if(num < 2) return false;
          if(num % x === 0) return false;
        } return true;
      }  
      for (var y = 2, z = 0; y <= num, z < num-1; y++, z++){
        if(y <= num) temp.push(y);
        if(zPrime(temp[z]) === true) primes.push(temp[z]);
      }
      sumUp = primes.reduce(function(a,b){
        return a + b;
      });
      return sumUp;
    }
    //There is no spoon!
    sumPrimes(1000);