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 19, 2026 23:02Mikołaj UzarskiMikołaj UzarskiScore: 5,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 23:035,76471,540,58842,858,0004,983,0002,326,528
2Feb 19, 2026 23:035,77073,733,19240,909,0006,984,0002,318,336
3Feb 19, 2026 23:075,78472,498,93641,004,0007,000,0002,482,176
4Feb 19, 2026 23:075,82771,129,65745,340,0003,022,0002,371,584
5Feb 19, 2026 23:095,89381,666,38940,930,0007,986,0002,396,160
6Feb 19, 2026 23:035,91373,386,33344,070,0005,008,0002,342,912
7Feb 19, 2026 23:075,92876,127,75443,179,0006,025,0002,383,872
8Feb 19, 2026 23:095,95670,483,84143,380,0006,053,0002,510,848
9Feb 19, 2026 23:095,98274,465,74543,696,0005,958,0002,293,760