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 03:10wnwnScore: 3,459Success
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 03:103,29735,886,72927,368,000020,480
2Sep 24, 2026 03:103,33136,412,13726,598,0001,055,0002,113,536
3Sep 24, 2026 03:103,44838,115,65128,619,000020,480
4Sep 24, 2026 03:103,44938,115,13828,630,000020,480
5Sep 24, 2026 03:103,45937,330,51528,710,000020,480
6Sep 24, 2026 03:103,46937,605,78228,794,000020,480
7Sep 24, 2026 03:103,47538,388,00228,845,000020,480
8Sep 24, 2026 03:103,48239,046,48228,908,000020,480
9Sep 24, 2026 03:103,49137,766,50327,967,0001,009,0002,113,536