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 24, 2026 20:30Daniel MastalerzDaniel MastalerzScore: 5,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 20:305,37070,160,46941,534,0003,039,0002,318,336
2Feb 24, 2026 20:305,37971,201,81541,601,0003,044,0002,326,528
3Feb 24, 2026 20:305,38073,081,50741,608,0003,044,0002,326,528
4Feb 24, 2026 20:305,39370,882,64840,781,0003,978,0002,318,336
5Feb 24, 2026 20:305,39775,195,11440,811,0003,981,0002,326,528
6Feb 24, 2026 20:305,40068,547,80840,833,0003,983,0002,326,528
7Feb 24, 2026 20:305,43569,156,99042,102,0003,007,0002,326,528
8Feb 24, 2026 20:305,43966,576,38742,137,0003,009,0002,514,944
9Feb 24, 2026 20:305,46671,727,97242,343,0003,024,0002,285,568
10Feb 24, 2026 20:305,47569,027,86342,415,0003,029,0002,367,488
11Feb 24, 2026 20:305,49672,358,36642,578,0003,041,0002,363,392
12Feb 24, 2026 20:305,64979,002,28843,891,0002,992,0002,314,240