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 listJul 31, 2026 18:12boop34boop34Score: 8,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:128,56581,812,51369,967,0001,129,0002,113,536
2Jul 31, 2026 18:128,58081,262,23870,000,0001,214,0002,113,536
3Jul 31, 2026 18:128,58381,290,41570,019,0001,224,0002,113,536
4Jul 31, 2026 18:128,59881,265,86570,255,0001,116,0002,113,536
5Jul 31, 2026 18:128,60881,434,75670,217,0001,234,0002,113,536
6Jul 31, 2026 18:128,61281,396,56270,480,0001,007,0002,113,536
7Jul 31, 2026 18:128,62681,561,69870,473,0001,131,0002,113,536
8Jul 31, 2026 18:128,63481,579,49970,527,0001,138,0002,113,536
9Jul 31, 2026 18:129,09285,398,01874,318,0001,148,0002,113,536