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 listMay 20, 2026 06:37M-RochatM-RochatScore: 11,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:3711,789107,647,01895,537,0002,313,0002,113,536
2May 20, 2026 06:3711,795108,199,82395,588,0002,317,0002,113,536
3May 20, 2026 06:3711,875110,806,09696,514,0002,056,0002,113,536
4May 20, 2026 06:3711,894108,714,16896,654,0002,072,0002,113,536
5May 20, 2026 06:3711,898109,612,82696,648,0002,109,0002,113,536
6May 20, 2026 06:3711,902110,479,39196,704,0002,084,0002,113,536
7May 20, 2026 06:3711,908109,153,76896,767,0002,071,0002,113,536
8May 20, 2026 06:3711,909108,816,68696,792,0002,055,0002,113,536
9May 20, 2026 06:3711,913109,988,13896,816,0002,070,0002,113,536