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 05:54M-RochatM-RochatScore: 14,524Success
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 05:5414,461131,489,134116,725,0003,302,0002,113,536
2May 20, 2026 05:5414,506129,992,332117,125,0003,279,0002,113,536
3May 20, 2026 05:5414,511134,693,738117,079,0003,369,0002,113,536
4May 20, 2026 05:5414,519129,864,574117,192,0003,316,0002,113,536
5May 20, 2026 05:5414,524129,976,041117,277,0003,279,0002,113,536
6May 20, 2026 05:5414,528130,066,440117,289,0003,295,0002,113,536
7May 20, 2026 05:5414,541130,071,703117,432,0003,265,0002,113,536
8May 20, 2026 05:5414,557131,586,008117,547,0003,281,0002,113,536
9May 20, 2026 05:5414,562132,339,764117,494,0003,374,0002,113,536