Find sum of all prime numbers within given range

algo_mid_five_1.js

function sumPrimesBasic(number) {
  // 1. Create final sum and call function for finding primes
  const findPrimes = (maximum) => {
    // 2. Inside function that finds prime declare initial variables
    let filter = [],
      primes = [];

    // 3. Loop through number smaller than the argument
    for (let i = 2; i <= maximum; i++) {
      // 4. This array contains multiplications. If it's there a number can't be prime
      if (!filter[i]) {
        // 5. If condition is met add it to primes
        primes.push(i);
        // 6. Find all multiplications of the number within given range
        for (let j = i; j <= maximum; j += i) {
          // 7. If a value has multiplications within given range flag them
          filter[j] = true;
        }
      }
    }
    return primes;
  };

  // 8. Sum up all values from the array
  return findPrimes(number).reduce((a, b) => a + b);
}

console.time('Start Algo 1');
console.log(sumPrimesBasic(10));
console.timeEnd('Start Algo 1'); // Start Algo 1: 0.97802734375ms