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 listSep 24, 2026 11:00wnwnScore: 3,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 11:013,31736,279,79726,500,0001,034,0002,113,536
2Sep 24, 2026 11:013,35736,582,16926,826,0001,045,0002,113,536
3Sep 24, 2026 11:013,41538,293,08727,336,0001,010,0002,113,536
4Sep 24, 2026 11:013,43137,233,15227,443,0001,040,0002,113,536
5Sep 24, 2026 11:013,43637,973,39727,478,0001,044,0002,113,536
6Sep 24, 2026 11:013,44237,142,14627,566,0001,010,0002,113,536
7Sep 24, 2026 11:013,44537,137,14727,557,0001,043,0002,113,536
8Sep 24, 2026 11:013,44837,331,44327,580,0001,041,0002,113,536
9Sep 24, 2026 11:013,46438,178,40627,722,0001,035,0002,113,536