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 listMay 6, 2026 18:54cashkarucashkaruScore: 58,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 18:5558,448503,489,377483,080,0002,040,0002,510,848
2May 6, 2026 18:5558,737503,796,904486,518,0001,007,0002,514,944
3May 6, 2026 18:5558,753502,798,093485,614,0002,036,0002,506,752
4May 6, 2026 18:5558,755506,587,388485,664,0002,007,0002,506,752
5May 6, 2026 18:5558,764503,440,694485,732,0002,011,0002,502,656
6May 6, 2026 18:5558,765508,935,044485,717,0002,038,0002,498,560
7May 6, 2026 18:5558,766505,142,235485,724,0002,034,0002,502,656
8May 6, 2026 18:5558,767502,537,900485,677,0002,090,0002,498,560
9May 6, 2026 18:5558,771508,815,321485,783,0002,022,0002,514,944