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 05:53wnwnScore: 4,320Success
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 05:554,17743,468,87427,019,0007,656,00020,480
2Sep 24, 2026 05:554,24743,969,58126,857,0008,394,0002,113,536
3Sep 24, 2026 05:554,27144,845,22028,054,0007,398,00020,480
4Sep 24, 2026 05:554,30944,399,08127,085,0008,686,0002,113,536
5Sep 24, 2026 05:554,32044,570,49228,296,0007,561,0002,113,536
6Sep 24, 2026 05:554,42845,522,86328,180,0008,578,0002,113,536
7Sep 24, 2026 05:554,48445,996,90427,181,00010,044,00020,480
8Sep 24, 2026 05:554,48445,968,85127,071,00010,151,0002,113,536
9Sep 24, 2026 05:554,63947,854,82828,881,0009,624,0002,113,536