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 17:09wnwnError
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 17:100744,338,364734,352,0001,045,0002,113,536expected "53686131385234614 ", got "18446744073709551045 53686131385234614 524127889 0 9998 10005 10017 10052 9950 9980 9985 9990 26187 26138 26107 26199 26203 26115 "
2Sep 24, 2026 17:100748,066,260737,755,0001,023,0002,113,536expected "53689620752931220 ", got "18446744073709551045 53689620752931220 524131707 0 10006 10000 10018 9995 9985 10005 9998 10100 26270 26272 26255 26295 26276 26403 "
3Sep 24, 2026 17:100746,024,466736,192,0001,037,0002,113,536expected "53687439498791945 ", got "18446744073709551045 53687439498791945 524131663 0 10013 10013 10018 10021 9983 9996 9997 9990 26275 26271 26298 26320 26253 26267 "