Sum of Primes up to N
EasyP3Coding
Given an integer n, return the sum of all prime numbers p with 1 <= p <= n. Return 0 if n < 2.
Example 1
- Input
- n = 10
- Output
- 17
Example 2
- Input
- n = 1
- Output
- 0
Example 3
- Input
- n = 2
- Output
- 2
Constraints
- 0 <= n <= 10^6
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 10. ⌘Enter runs, ⌘⇧Enter submits.