forked from nayuki/Project-Euler-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp010.java
More file actions
30 lines (23 loc) · 696 Bytes
/
p010.java
File metadata and controls
30 lines (23 loc) · 696 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
/*
* Solution to Project Euler problem 10
* Copyright (c) Project Nayuki. All rights reserved.
*
* https://www.nayuki.io/page/project-euler-solutions
* https://github.com/nayuki/Project-Euler-solutions
*/
public final class p010 implements EulerSolution {
public static void main(String[] args) {
System.out.println(new p010().run());
}
/*
* Call the sieve of Eratosthenes and sum the primes found.
* A conservative upper bound for the sum is 2000000^2, which fits in a Java long type.
*/
private static final int LIMIT = 2000000;
public String run() {
long sum = 0;
for (int p : Library.listPrimes(LIMIT - 1))
sum += p;
return Long.toString(sum);
}
}