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 18, 2026 18:45wnwnScore: 7,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:456,24873,630,26349,866,0001,994,0002,306,048
2Feb 18, 2026 18:456,28676,939,47250,165,0002,006,0002,289,664
3Feb 18, 2026 18:456,28879,884,89649,183,0003,011,0002,281,472
4Feb 18, 2026 18:457,20285,866,59857,788,0001,992,0002,523,136
5Feb 18, 2026 18:457,22480,034,44156,964,0002,998,0002,441,216
6Feb 18, 2026 18:457,35386,816,88658,030,0003,001,0002,396,160