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 listAug 24, 2026 20:22Victor MerckléVictor MerckléScore: 3,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:233,74439,492,00229,899,0001,182,0002,117,632stderr
2Aug 24, 2026 20:233,74740,115,96729,945,0001,158,0002,117,632stderr
3Aug 24, 2026 20:233,75339,589,14630,041,0001,115,0002,117,632stderr
4Aug 24, 2026 20:233,75440,279,84329,990,0001,171,0002,117,632stderr
5Aug 24, 2026 20:233,76239,630,45230,105,0001,124,0002,117,632stderr
6Aug 24, 2026 20:233,78239,874,44630,221,0001,172,0002,117,632stderr
7Aug 24, 2026 20:233,78739,795,28430,387,0001,049,0002,117,632stderr
8Aug 24, 2026 20:233,79440,563,01130,310,0001,184,0002,117,632stderr
9Aug 24, 2026 20:233,94841,141,73931,706,0001,070,0002,117,632stderr