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 listSep 7, 2026 16:59Victor MerckléVictor MerckléScore: 4,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:004,70647,566,16533,034,0006,031,0002,117,632stderr
2Sep 7, 2026 17:004,72447,741,43233,049,0006,165,0002,117,632stderr
3Sep 7, 2026 17:004,78448,166,51333,650,0006,063,00024,576stderr
4Sep 7, 2026 17:004,93450,887,71833,184,0007,769,00024,576stderr
5Sep 7, 2026 17:004,93850,087,57933,285,0007,702,00024,576stderr
6Sep 7, 2026 17:004,97949,827,56433,351,0007,975,0002,117,632stderr
7Sep 7, 2026 17:005,00550,027,15433,426,0008,122,0002,117,632stderr
8Sep 7, 2026 17:005,05451,159,95933,408,0008,545,0002,117,632stderr
9Sep 7, 2026 17:005,06650,738,00534,007,0008,046,00024,576stderr