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 24, 2026 20:54Mikołaj UzarskiMikołaj UzarskiScore: 5,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 20:555,52666,412,24943,869,0001,994,0002,510,848
2Feb 24, 2026 20:545,53267,295,60143,922,0001,996,0002,281,472
3Feb 24, 2026 20:545,53269,801,55743,922,0001,996,0002,510,848
4Feb 24, 2026 20:555,55072,025,30644,060,0002,002,0002,285,568
5Feb 24, 2026 20:555,55368,380,36845,085,0001,001,0002,285,568
6Feb 24, 2026 20:545,57274,486,66745,242,0001,005,0002,281,472
7Feb 24, 2026 20:545,59067,990,37345,385,0001,008,0002,281,472
8Feb 24, 2026 20:545,62682,615,76744,666,0002,030,0002,502,656
9Feb 24, 2026 20:546,60378,686,12552,811,0001,992,0002,510,848