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 2, 2026 17:37Karthik 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 2, 2026 17:37039,254,93026,889,0003,530,00020,480expected "53694235656489296 ", got "13 59 2016 26761 M "
2Oct 2, 2026 17:37039,396,63426,704,0004,052,0002,113,536expected "53683263629751482 ", got "14 59 2117 26574 M "
3Oct 2, 2026 17:37039,940,69727,165,0003,955,00020,480expected "53690951819667913 ", got "13 61 2273 27043 M "