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 18:33Mikołaj UzarskiMikołaj UzarskiScore: 37,820Success
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 18:3337,788339,269,465311,641,0001,997,0002,285,568
2Feb 6, 2026 18:3337,788339,265,918311,643,0001,997,0002,285,568
3Feb 6, 2026 18:3337,816336,691,189311,870,0001,999,0002,527,232
4Feb 6, 2026 18:3337,819335,906,362311,901,0001,999,0002,285,568
5Feb 6, 2026 18:3337,820338,259,059311,911,0001,999,0002,285,568
6Feb 6, 2026 18:3337,822338,282,594312,926,000999,0002,285,568
7Feb 6, 2026 18:3337,829339,727,999313,978,00002,281,472
8Feb 6, 2026 18:3337,829339,654,709311,984,0001,999,0002,285,568
9Feb 6, 2026 18:3337,830339,155,802311,993,0001,999,0002,527,232