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 04:34wnwnScore: 3,925Success
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 04:363,73939,826,50626,745,0004,293,00020,480
2Sep 24, 2026 04:363,78640,000,59626,751,0004,680,00020,480
3Sep 24, 2026 04:363,81040,299,79226,884,0004,747,0002,113,536
4Sep 24, 2026 04:363,85940,778,54527,961,0004,075,00020,480
5Sep 24, 2026 04:363,92541,945,65927,771,0004,809,0002,113,536
6Sep 24, 2026 04:363,93841,338,24226,678,0006,015,0002,113,536
7Sep 24, 2026 04:363,97341,786,00428,185,0004,799,0002,113,536
8Sep 24, 2026 04:364,01342,778,85828,236,0005,080,0002,113,536
9Sep 24, 2026 04:364,07842,624,42528,124,0005,727,00020,480