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:29wnwnError
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:300746,956,214737,099,0001,019,0002,113,536expected "53688912641524638 ", got "18446744073709551049 53688912641524638 524135693 0 10000 10004 10010 10002 10009 10015 10008 9983 26289 26300 26295 26311 26325 26294 "
2Sep 24, 2026 18:300748,381,792736,425,0001,031,0002,113,536expected "53694693731897509 ", got "18446744073709551049 53694693731897509 524140173 0 10000 9996 9993 9963 10022 10019 10002 10001 26232 26251 26231 26224 26281 26229 "
3Sep 24, 2026 18:300745,735,584735,685,0001,118,0002,113,536expected "53687624989978767 ", got "18446744073709551049 53687624989978767 524130417 0 10000 9982 9958 10001 10003 10009 9994 10005 26278 26250 26242 26245 26265 26248 "