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 listMar 17, 2026 16:36shartgepettoshartgepettoScore: 7,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 16:367,19388,461,83954,726,0004,975,0002,514,944
2Mar 18, 2026 12:127,20887,100,10255,840,0003,988,0002,478,080
3Mar 18, 2026 12:127,21485,730,09757,850,0002,029,0002,420,736
4Mar 18, 2026 12:127,23579,464,95359,054,0001,000,0002,482,176
5Mar 17, 2026 16:367,24783,201,11957,143,0003,007,0002,453,504
6Mar 17, 2026 16:367,43498,546,14459,710,0001,990,0002,412,544