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 23, 2026 09:04Kevin HeaveyKevin HeaveyScore: 3,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 09:053,21736,521,36125,570,0001,132,0002,113,536
2Sep 23, 2026 09:053,23336,355,87125,828,0001,010,0002,113,536
3Sep 23, 2026 09:053,25236,575,59625,793,0001,205,0002,113,536
4Sep 23, 2026 09:053,25336,595,30725,972,0001,032,0002,113,536
5Sep 23, 2026 09:053,25436,540,75225,982,0001,033,0002,113,536
6Sep 23, 2026 09:053,25436,527,01625,981,0001,029,0002,113,536
7Sep 23, 2026 09:053,25636,605,58625,817,0001,215,0002,113,536
8Sep 23, 2026 09:053,25635,903,97126,022,0001,011,0002,113,536
9Sep 23, 2026 09:053,26335,924,18325,875,0001,210,0002,113,536