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:55M-RochatM-RochatScore: 12,014Success
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:5611,988110,943,13896,229,0003,278,0002,113,536
2May 20, 2026 05:5611,996110,026,37696,219,0003,351,0002,113,536
3May 20, 2026 05:5612,001111,359,75496,319,0003,296,0002,113,536
4May 20, 2026 05:5612,006111,669,67596,369,0003,284,0002,113,536
5May 20, 2026 05:5612,014109,594,00896,345,0003,375,0002,113,536
6May 20, 2026 05:5612,018109,535,64196,454,0003,302,0002,113,536
7May 20, 2026 05:5612,025111,220,79696,386,0003,423,0002,113,536
8May 20, 2026 05:5612,104110,546,14697,059,0003,412,0002,113,536
9May 20, 2026 05:5612,112111,653,11497,071,0003,461,0002,113,536