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 20, 2026 02:16Maya RebholzMaya RebholzScore: 14,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 02:1614,274128,969,185111,853,0006,622,0002,113,536
2May 20, 2026 02:1614,278131,028,422111,821,0006,690,0002,113,536
3May 20, 2026 02:1614,282129,117,364111,855,0006,692,0002,113,536
4May 20, 2026 02:1614,285127,922,648111,864,0006,705,0002,113,536
5May 20, 2026 02:1614,286130,778,020111,954,0006,624,0002,113,536
6May 20, 2026 02:1614,287128,956,884111,859,0006,731,0002,113,536
7May 20, 2026 02:1614,308128,685,967111,856,0006,904,0002,113,536
8May 20, 2026 02:1614,320129,650,948111,892,0006,969,0002,113,536
9May 20, 2026 02:1614,321129,766,828111,929,0006,943,0002,113,536