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 listFeb 15, 2026 13:38Daniel MastalerzDaniel MastalerzScore: 6,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 13:386,72587,776,79652,830,0002,990,0002,326,528
2Feb 15, 2026 13:386,73879,942,27751,930,0003,994,0002,306,048
3Feb 15, 2026 13:386,75380,807,95652,048,0004,003,0002,277,376
4Feb 15, 2026 13:386,81383,229,18954,528,0002,019,0002,519,040
5Feb 15, 2026 13:386,86584,232,03253,979,0002,998,0002,269,184
6Feb 15, 2026 13:386,87383,057,48754,042,0003,002,0002,260,992