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 listFeb 22, 2026 22:44wnwnScore: 5,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 22:444,95966,876,35739,155,0002,007,0002,478,080
2Feb 22, 2026 22:504,99161,997,18940,416,0001,010,0002,277,376
3Feb 22, 2026 22:505,00062,871,00040,484,0001,012,0002,494,464
4Feb 22, 2026 22:505,01278,626,40140,585,0001,014,0002,277,376
5Feb 22, 2026 22:445,01666,622,11640,614,0001,015,0002,277,376
6Feb 22, 2026 22:445,04162,083,17739,851,0001,992,0002,527,232