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 21, 2026 21:37M-RochatM-RochatScore: 8,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 21:378,65881,898,72270,849,0001,013,0002,113,536
2May 21, 2026 21:378,68381,335,02471,058,0001,012,0002,113,536
3May 21, 2026 21:378,72382,124,30471,395,0001,013,0002,113,536
4May 21, 2026 21:378,74184,592,38371,541,0001,013,0002,113,536
5May 21, 2026 21:378,74784,199,21071,594,0001,013,0002,113,536
6May 21, 2026 21:378,75485,688,24971,651,0001,012,0002,113,536
7May 21, 2026 21:378,75483,530,22371,650,0001,012,0002,113,536
8May 21, 2026 21:378,77083,743,39271,781,0001,012,0002,113,536
9May 21, 2026 21:378,85784,021,70272,503,0001,013,0002,113,536