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:31wnwnScore: 3,997Success
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:313,92941,374,24628,885,0003,727,0002,113,536
2Sep 24, 2026 04:313,94541,518,51529,019,0003,726,00020,480
3Sep 24, 2026 04:313,96541,388,18729,119,0003,793,00020,480
4Sep 24, 2026 04:313,96941,727,39228,881,0004,068,00020,480
5Sep 24, 2026 04:313,99741,939,39728,921,0004,258,0002,113,536
6Sep 24, 2026 04:314,05242,296,81729,945,0003,687,0002,113,536
7Sep 24, 2026 04:314,05943,062,30231,078,0002,612,00020,480
8Sep 24, 2026 04:314,11143,536,20430,297,0003,829,00020,480
9Sep 24, 2026 04:314,19944,269,77630,166,0004,692,0002,113,536