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 6, 2026 16:24Mikołaj UzarskiMikołaj UzarskiScore: 55,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 16:2455,721490,674,041461,485,0001,001,0002,285,568
2Feb 6, 2026 16:3955,721489,397,304461,482,0001,001,0002,285,568
3Feb 6, 2026 16:2455,722492,046,711460,494,0001,997,0002,285,568
4Feb 6, 2026 16:2455,731487,817,796460,567,0001,998,0002,285,568
5Feb 6, 2026 16:3955,734490,842,095460,596,0001,998,0002,285,568
6Feb 6, 2026 16:2455,736496,612,615461,613,000999,0002,523,136
7Feb 6, 2026 16:2455,737490,566,141461,616,000999,0002,523,136
8Feb 6, 2026 16:2455,738490,386,583460,630,0001,998,0002,523,136
9Feb 6, 2026 16:2455,739491,237,491460,634,0001,998,0002,269,184
10Feb 6, 2026 16:2455,739490,302,883461,633,000999,0002,285,568
11Feb 6, 2026 16:3955,744485,201,253460,676,0001,998,0002,351,104
12Feb 6, 2026 16:2455,790491,094,612461,061,0002,000,0002,285,568