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 10:38M-RochatM-RochatScore: 6,873Success
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 10:386,75668,194,50253,992,0002,084,0002,113,536
2May 20, 2026 10:386,79870,634,21554,255,0002,173,0002,113,536
3May 20, 2026 10:386,82268,889,50054,445,0002,181,0002,113,536
4May 20, 2026 10:386,83266,319,70254,548,0002,161,0002,113,536
5May 20, 2026 10:386,87367,957,98054,884,0002,164,0002,113,536
6May 20, 2026 10:386,89267,745,64655,011,0002,195,0002,113,536
7May 20, 2026 10:386,91768,565,63155,266,0002,152,0002,113,536
8May 20, 2026 10:386,92069,677,64455,233,0002,204,0002,113,536
9May 20, 2026 10:386,93169,839,24755,356,0002,172,0002,113,536