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 5, 2026 08:11M-RochatM-RochatScore: 26,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 08:1226,849240,658,640221,820,0001,033,0002,392,064
2May 5, 2026 08:1226,874238,448,655222,049,0001,006,0002,383,872
3May 5, 2026 08:1226,876239,590,664222,017,0001,054,0002,383,872
4May 5, 2026 08:1226,880239,313,671222,081,0001,024,0002,379,776
5May 5, 2026 08:1226,885237,996,786222,126,0001,026,0002,383,872
6May 5, 2026 08:1226,897241,116,349222,205,0001,044,0002,379,776
7May 5, 2026 08:1226,897240,306,427222,208,0001,040,0002,379,776
8May 5, 2026 08:1226,928240,836,383222,445,0001,061,0002,375,680
9May 5, 2026 08:1226,934237,423,977222,530,0001,030,0002,375,680