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 listFeb 28, 2026 07:54Benji WhiteBenji WhiteScore: 2,066,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 07:542,064,98117,168,409,23017,065,374,00073,966,0002,289,664
2Feb 28, 2026 07:542,065,98817,185,713,75017,083,731,00063,969,0002,281,472
3Feb 28, 2026 07:542,066,47217,182,579,11617,079,752,00071,965,0002,293,760
4Feb 28, 2026 07:542,066,63817,186,533,58217,085,125,00067,968,0002,281,472
5Feb 28, 2026 07:542,066,87317,187,822,36017,075,081,00079,967,0002,289,664
6Feb 28, 2026 07:542,067,00817,190,661,43917,095,198,00060,972,0002,281,472
7Feb 28, 2026 07:542,067,18317,192,691,95417,093,645,00063,972,0002,281,472
8Feb 28, 2026 07:542,068,38017,204,451,96317,102,578,00064,975,0002,514,944
9Feb 28, 2026 07:542,263,37418,820,754,40818,722,033,00063,969,0002,265,088