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 18:12wnwnError
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 18:130744,691,397734,808,0001,012,0002,113,536expected "53678212680521713 ", got "18446744073709551048 53678212680521713 524126205 0 10005 9993 10001 10009 10008 10008 9984 10000 26208 26196 26199 26212 26216 26195 "
2Sep 24, 2026 18:130749,862,604739,278,0001,054,0002,113,536expected "53691761456477595 ", got "18446744073709551048 53691761456477595 524135105 0 9987 9995 10004 10004 10007 10019 9997 9996 26336 26336 26323 26341 26377 26321 "
3Sep 24, 2026 18:130746,937,147737,038,0001,093,0002,113,536expected "53682605706195848 ", got "18446744073709551048 53682605706195848 524127562 0 9993 10001 10016 10002 10005 10003 10091 9995 26246 26229 26221 26253 26246 26374 "