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 listMay 11, 2026 17:27Benjamin Rogers-NewsomeBenjamin Rogers-NewsomeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 17:28010,058,463,3729,979,602,00068,055,0002,117,632expected "53694595248951434 ", got "1591654581738793034 "
2May 11, 2026 17:28010,057,710,5769,978,517,00067,240,0002,117,632expected "53687170490954424 ", got "1591326471399808824 "
3May 11, 2026 17:28010,058,531,8869,978,760,00068,309,0002,117,632expected "53680202293100870 ", got "1591253230428856070 "