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 listMay 16, 2026 02:38Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 02:39067,193,29957,277,0001,011,0002,113,536expected "53693771018402015 ", got "53693768714402015 "
2May 16, 2026 02:396,94966,646,68756,664,0001,017,0002,113,536
3May 16, 2026 02:396,95067,462,86756,658,0001,035,0002,113,536
4May 16, 2026 02:396,95067,233,03856,666,0001,022,0002,113,536
5May 16, 2026 02:396,95765,944,48456,731,0001,019,0002,113,536
6May 16, 2026 02:396,95965,698,26156,758,0001,003,0002,113,536
7May 16, 2026 02:396,96767,886,55956,812,0001,020,0002,113,536
8May 16, 2026 02:396,96765,844,90357,828,00002,113,536
9May 16, 2026 02:397,01066,891,27058,191,00002,113,536