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 16, 2026 17:40Daniel MastalerzDaniel MastalerzScore: 7,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 17:407,69286,781,01060,853,0002,992,0002,301,952
2Feb 16, 2026 17:407,69987,537,55460,909,0002,995,0002,281,472
3Feb 16, 2026 17:407,70388,944,81160,935,0002,996,0002,301,952
4Feb 16, 2026 17:407,90294,632,50063,570,0002,018,0002,269,184
5Feb 16, 2026 17:407,90494,666,88963,588,0002,018,0002,293,760
6Feb 16, 2026 17:407,90491,495,82363,583,0002,018,0002,293,760