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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:305,76074,252,69845,815,0001,991,0002,514,944
2Feb 20, 2026 16:305,76971,026,78843,892,0003,990,0002,330,624
3Feb 20, 2026 16:305,77369,549,28543,926,0003,993,0002,330,624
4Feb 20, 2026 16:305,83271,885,45445,379,0003,025,0002,265,088
5Feb 20, 2026 16:305,85981,839,98745,589,0003,039,0002,310,144
6Feb 20, 2026 16:305,86670,533,03444,714,0003,974,0002,519,040