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:38wnwnError
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:410779,702,061752,490,00018,395,0002,113,536expected "53683940164022451 ", got "18446744073709551030 53683940164022451 524130330 0 10016 9991 10676 10676 10147 10038 10104 10105 26569 26580 26577 28388 26818 26849 "
2Sep 24, 2026 12:410780,857,818755,155,00016,897,0002,113,536expected "53682979681373514 ", got "18446744073709551030 53682979681373514 524126902 0 9997 9998 10650 10662 10061 10067 10162 10186 26713 26700 26705 28472 26878 27158 "
3Sep 24, 2026 12:410778,859,574752,827,00017,083,0002,113,536expected "53692616241329517 ", got "18446744073709551030 53692616241329517 524136758 0 9996 9996 10729 10687 10121 10117 10090 10080 26589 26598 26587 28491 26903 26811 "