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 15, 2026 00:04Victor MerckléVictor MerckléScore: 4,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 00:074,85450,690,79939,147,0001,144,0002,117,632stderr
2Sep 15, 2026 00:074,85550,685,37639,190,0001,109,0002,117,632stderr
3Sep 15, 2026 00:074,85950,072,93439,212,0001,124,0002,117,632stderr
4Sep 15, 2026 00:074,87050,793,74439,293,0001,132,0002,117,632stderr
5Sep 15, 2026 00:074,88250,932,34939,471,0001,051,0002,117,632stderr
6Sep 15, 2026 00:074,89251,062,86239,461,0001,150,0002,117,632stderr
7Sep 15, 2026 00:074,93951,395,37239,846,0001,150,0002,117,632stderr
8Sep 15, 2026 00:074,94250,814,25039,882,0001,137,0002,117,632stderr
9Sep 15, 2026 00:074,99552,023,86340,311,0001,153,0002,117,632stderr