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:03wnwnError
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:050746,550,162736,570,0001,014,0002,113,536expected "53679922576180451 ", got "18446744073709551047 53679922576180451 524121923 0 9998 10000 10002 10017 10007 10016 9996 9997 26250 26224 26218 26273 26282 26224 "
2Sep 24, 2026 18:050747,200,566736,711,0001,006,0002,113,536expected "53685889483474820 ", got "18446744073709551047 53685889483474820 524129428 0 9999 9999 10068 10020 10016 10016 9999 9991 26254 26248 26246 26366 26295 26245 "
3Sep 24, 2026 18:050748,058,725737,533,0001,056,0002,113,536expected "53681880880201738 ", got "18446744073709551047 53681880880201738 524121317 0 9997 9994 10029 10010 10021 9994 10009 10001 26264 26285 26262 26324 26320 26271 "