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 06:02Victor MerckléVictor MerckléScore: 4,656Success
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 06:054,46556,458,38828,309,0008,754,0002,117,632stderr
2Sep 8, 2026 06:054,48055,822,99228,792,0008,399,0002,117,632stderr
3Sep 8, 2026 06:054,62156,997,16828,469,0009,887,0002,117,632stderr
4Sep 8, 2026 06:054,63657,182,44228,972,0009,509,0002,117,632stderr
5Sep 8, 2026 06:054,65657,350,68428,230,00010,419,0002,117,632stderr
6Sep 8, 2026 06:054,78359,076,06328,664,00011,042,0002,117,632stderr
7Sep 8, 2026 06:054,82558,721,84129,251,00010,800,0002,117,632stderr
8Sep 8, 2026 06:054,83458,815,74228,465,00011,664,0002,117,632stderr
9Sep 8, 2026 06:055,20762,721,42528,499,00014,723,0002,117,632stderr