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 8, 2026 19:27Victor MerckléVictor MerckléScore: 3,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 19:273,58138,580,07528,661,0001,063,0002,117,632stderr
2Sep 8, 2026 19:273,65338,889,26829,203,0001,122,0002,117,632stderr
3Sep 8, 2026 19:273,65438,949,37629,215,0001,114,0002,117,632stderr
4Sep 8, 2026 19:273,65538,901,36929,198,0001,145,0002,117,632stderr
5Sep 8, 2026 19:273,65838,940,50829,260,0001,103,0002,117,632stderr
6Sep 8, 2026 19:273,67039,096,94829,430,0001,032,0002,117,632stderr
7Sep 8, 2026 19:273,67239,098,78429,356,0001,123,0002,117,632stderr
8Sep 8, 2026 19:273,67639,092,35829,406,0001,105,0002,117,632stderr
9Sep 8, 2026 19:273,67939,068,00329,431,0001,108,0002,117,632stderr