Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJun 30, 2026 10:01Victor MerckléVictor MerckléScore: 4,166Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:024,13942,200,24533,243,0001,113,0002,117,632stderr
2Jun 30, 2026 10:024,14644,424,41233,290,0001,125,0002,117,632stderr
3Jun 30, 2026 10:024,15842,267,13233,393,0001,126,0002,117,632stderr
4Jun 30, 2026 10:024,15842,325,03633,437,0001,078,0002,117,632stderr
5Jun 30, 2026 10:024,16642,388,41333,447,0001,131,0002,117,632stderr
6Jun 30, 2026 10:024,16742,321,60733,551,0001,037,0002,117,632stderr
7Jun 30, 2026 10:024,17042,414,44233,520,0001,099,0002,117,632stderr
8Jun 30, 2026 10:024,17642,587,49133,628,0001,033,0002,117,632stderr
9Jun 30, 2026 10:024,17842,499,08333,670,0001,013,0002,117,632stderr