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 19, 2026 17:03Daniel MastalerzDaniel MastalerzScore: 9,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 17:038,937100,531,76472,170,0002,004,0002,519,040
2Feb 19, 2026 17:038,94295,849,24771,210,0003,008,0002,277,376
3Feb 19, 2026 17:038,944102,098,82274,239,00002,289,664
4Feb 19, 2026 17:039,131101,655,38073,792,0001,994,0002,523,136
5Feb 19, 2026 17:039,138101,826,48373,853,0001,996,0002,265,088
6Feb 19, 2026 17:039,144100,361,13672,901,0002,995,0002,523,136