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:08wnwnError
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:120750,071,384740,203,0001,036,0002,113,536expected "53681276920604989 ", got "18446744073709551027 53681276920604989 524121972 0 9995 10004 10177 10207 9925 9974 10009 9997 26356 26331 26338 26881 26199 26340 "
2Sep 24, 2026 12:120750,109,238740,184,0001,097,0002,113,536expected "53685373209769158 ", got "18446744073709551027 53685373209769158 524131232 0 9995 10004 10065 10230 9994 9983 10005 10003 26327 26315 26314 26725 26288 26325 "
3Sep 24, 2026 12:120753,740,463743,917,0001,112,0002,113,536expected "53693719073028874 ", got "18446744073709551027 53693719073028874 524136428 0 10007 9999 10162 10166 9928 9922 10003 10001 26488 26485 26494 26930 26287 26490 "