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 listMar 7, 2026 20:19pseppsepScore: 41,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2026 20:1741,181367,722,404338,807,0002,998,0002,387,968
2Mar 7, 2026 20:1941,185369,651,008338,841,0002,998,0002,392,064
3Mar 7, 2026 20:1741,245365,818,030342,332,00002,383,872
4Mar 7, 2026 20:1941,285371,187,494340,671,0001,998,0002,514,944
5Mar 7, 2026 20:1941,299367,843,437340,783,0001,998,0002,514,944
6Mar 7, 2026 20:1741,309372,881,626340,866,0001,999,0002,506,752