import Foundation
func isPrime(_ n: Int) -> Bool {
if n < 2 || (n % 2 == 0 && n != 2) { return false }
let limit = Int(Double(n).squareRoot())
for i in stride(from: 3, through: limit, by: 2) {
if n % i == 0 { return false }
}
return true
}
func main() {
let num = 10000
var sum = 0
for i in 2..<num {
if isPrime(i) {
sum += i
}
}
print("sum = \(sum)")
}
main()
/*
run:
sum = 5736396
*/