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:13wnwnError
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:140758,439,085746,641,0001,029,0002,113,536expected "53689574842242515 ", got "18446744073709551022 53689574842242515 524130804 0 9997 9998 10021 10017 10303 10146 11756 11759 26058 26047 26037 26094 26673 30618 "
2Sep 24, 2026 11:140755,627,219745,827,0001,011,0002,113,536expected "53695781790086261 ", got "18446744073709551022 53695781790086261 524139521 0 9991 10003 10033 10038 10112 10147 11767 11775 26050 26023 26028 26119 26405 30630 "
3Sep 24, 2026 11:140758,382,376747,842,0001,079,0002,113,536expected "53688268432126234 ", got "18446744073709551022 53688268432126234 524131998 0 9994 9998 10006 10005 10086 10095 11750 11738 26148 26139 26134 26162 26385 30696 "