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 26, 2026 09:34lipapipalipapipaScore: 5,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 09:345,78673,908,26545,020,0003,001,0002,342,912
2Feb 26, 2026 09:345,82673,655,11846,344,0002,014,0002,473,984
3Feb 26, 2026 09:345,83571,645,09045,406,0003,027,0002,355,200
4Feb 26, 2026 09:345,88279,661,55746,828,0001,992,0002,523,136
5Feb 26, 2026 09:345,89870,079,20846,959,0001,998,0002,465,792
6Feb 26, 2026 09:345,94975,525,26247,363,0002,015,0002,367,488