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 13:46wnwnError
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 13:460746,149,395736,322,0001,013,0002,113,536expected "53694840825184509 ", got "18446744073709551036 53694840825184509 524135539 0 10004 9993 9998 9992 10004 10008 9998 10002 26258 26259 26258 26249 26278 26252 "
2Sep 24, 2026 13:460750,084,045739,958,0001,113,0002,113,536expected "53682662324039308 ", got "18446744073709551036 53682662324039308 524126575 0 9999 9992 10002 10016 10016 10022 9990 9969 26365 26373 26354 26383 26407 26347 "
3Sep 24, 2026 13:460748,634,349738,105,0001,104,0002,113,536expected "53685387476471760 ", got "18446744073709551036 53685387476471760 524129152 0 10000 9998 10001 10017 9997 10013 10044 9996 26288 26270 26270 26319 26294 26326 "