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 11:39wnwnError
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 11:390737,975,519728,046,0001,062,0002,113,536expected "53687384616294173 ", got "18446744073709551024 53687384616294173 524134450 0 9995 9998 10023 10021 9982 9993 9987 10004 25997 25988 25984 26046 25960 25992 "
2Sep 24, 2026 11:390740,788,676730,860,0001,055,0002,113,536expected "53688853534869127 ", got "18446744073709551024 53688853534869127 524128813 0 10036 9977 10043 10026 9988 9988 9997 10009 26082 26091 26121 26174 26057 26082 "
3Sep 24, 2026 11:390742,939,324731,242,0001,084,0002,113,536expected "53687586097938671 ", got "18446744073709551024 53687586097938671 524135682 0 10007 9988 10033 10031 9980 9996 9997 9999 26049 26037 26037 26124 26029 26030 "