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 08:13wnwnScore: 3,318Success
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 08:133,29936,109,04426,388,0001,001,0002,113,536
2Sep 24, 2026 08:133,30036,150,32026,362,0001,030,0002,113,536
3Sep 24, 2026 08:133,30636,238,85926,435,0001,005,0002,113,536
4Sep 24, 2026 08:133,31836,349,14126,505,0001,035,0002,113,536
5Sep 24, 2026 08:133,31836,131,01726,530,0001,015,0002,113,536
6Sep 24, 2026 08:133,33536,448,73626,669,0001,012,0002,113,536
7Sep 24, 2026 08:133,35636,474,01126,774,0001,082,0002,113,536
8Sep 24, 2026 08:133,41936,965,19127,374,0001,005,0002,113,536
9Sep 24, 2026 08:133,44537,961,08727,569,0001,030,0002,113,536