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 12:43wnwnError
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 12:430752,156,125742,344,0001,016,0002,113,536expected "53697868382004702 ", got "18446744073709551031 53697868382004702 524139107 0 9985 10001 10206 10198 10407 10396 10001 9991 26336 26330 26338 26850 27388 26319 "
2Sep 24, 2026 12:430757,821,887747,297,0001,033,0002,113,536expected "53695865941777319 ", got "18446744073709551031 53695865941777319 524136988 0 10001 10004 10110 10122 10334 10333 10008 10008 26500 26489 26500 26810 27377 26517 "
3Sep 24, 2026 12:430753,776,024743,822,0001,097,0002,113,536expected "53688344833133220 ", got "18446744073709551031 53688344833133220 524130937 0 9991 9996 10135 10134 10367 10400 9994 9998 26383 26369 26352 26723 27416 26359 "