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 listOct 9, 2026 21:26Karthik ReddyKarthik ReddyError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:2903,165,187,578154,941,0001,112,0002,113,536expected "53695426730566113 ", got " base 26259=53695426730566113 b2 25644=53695426730566113 base 25659 b2 25637 base 25655 b2 25614 "
2Oct 9, 2026 21:2903,165,743,059155,498,0001,111,0002,113,536expected "53681851306751107 ", got " base 26529=53681851306751107 b2 25703=53681851306751107 base 25694 b2 25703 base 25707 b2 25701 "
3Oct 9, 2026 21:2903,166,106,263155,504,0001,118,0002,113,536expected "53689573276040242 ", got " base 26341=53689573276040242 b2 25747=53689573276040242 base 25740 b2 25740 base 25750 b2 25734 "