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 23, 2026 08:45Kevin HeaveyKevin HeaveyScore: 3,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:513,24035,692,75025,794,0001,100,0002,113,536
2Sep 23, 2026 08:513,24135,594,22425,775,0001,126,0002,113,536
3Sep 23, 2026 08:513,25336,601,78725,850,0001,158,0002,113,536
4Sep 23, 2026 08:513,26836,734,20626,119,0001,009,0002,113,536
5Sep 23, 2026 08:513,26936,661,86825,936,0001,203,0002,113,536
6Sep 23, 2026 08:513,27136,749,60926,141,0001,016,0002,113,536
7Sep 23, 2026 08:513,27235,891,69926,153,0001,011,0002,113,536
8Sep 23, 2026 08:513,27635,880,13726,008,0001,189,0002,113,536
9Sep 23, 2026 08:513,29035,963,42826,147,0001,164,0002,113,536