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 17, 2026 21:53lipapipalipapipaScore: 6,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 21:536,45274,968,20651,528,0002,020,0002,498,560
2Feb 17, 2026 21:536,69786,086,23654,572,0001,010,0002,498,560
3Feb 17, 2026 21:536,70082,125,81054,599,0001,011,0002,498,560
4Feb 17, 2026 21:536,73183,587,25951,875,0003,990,0002,297,856
5Feb 17, 2026 21:536,79177,546,43853,349,0003,019,0002,322,432
6Feb 17, 2026 21:536,96784,001,47354,835,0002,991,0002,502,656