SOURCE

/*
 * 通过筛法进行计算
 */
function calPrime(range) {
  var len = range+1,
      container = new Array(len),
      res = [],
      sum = 0;
  for(var i=2; i<len; i++) {
    if(!container[i]) {
      for(var j=1; ; j++) {
        var acc = i*j;
        if(acc>len) {
          break;
        } else {
          if(!container[acc]) {
            container[acc] = true;
          }
        }
      }
      res.push(i);
      sum += i;
    }
  }
  return {ary: res, val: sum};
}

var prime10000 = calPrime(10000);
console.log(prime10000.val);