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 01:43Josu San MartinJosu San MartinScore: 6,152Success
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 01:435,99977,237,02848,800,000995,0002,281,472
2Feb 19, 2026 01:436,13379,345,12548,904,0001,996,0002,277,376
3Feb 19, 2026 01:436,14373,410,00649,992,000999,0002,498,560
4Feb 19, 2026 01:436,15276,639,57849,057,0002,002,0002,281,472
5Feb 19, 2026 01:436,16178,621,50649,132,0002,005,0002,277,376
6Feb 19, 2026 01:436,17074,608,52249,205,0002,008,0002,400,256