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:22wnwnError
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:230751,797,622741,248,0001,107,0002,113,536expected "53691703643174732 ", got "18446744073709551028 53691703643174732 524133969 0 9991 9995 10015 10013 9972 9994 10009 10021 26426 26395 26396 26433 26389 26443 "
2Sep 24, 2026 12:230745,024,943735,219,0001,025,0002,113,536expected "53692925499558628 ", got "18446744073709551028 53692925499558628 524133358 0 9998 9997 10003 10010 10004 10003 10005 10043 26241 26236 26229 26269 26248 26295 "
3Sep 24, 2026 12:230749,702,132739,825,0001,059,0002,113,536expected "53688805207016627 ", got "18446744073709551028 53688805207016627 524128042 0 10002 10000 10040 10023 9994 10033 10032 10023 26347 26344 26345 26432 26387 26416 "