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 15, 2026 18:31boop34boop34Score: 9,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 18:329,23986,247,29575,679,0001,007,0002,113,536
2Jul 15, 2026 18:329,26086,397,62775,856,0001,008,0002,113,536
3Jul 15, 2026 18:329,28086,642,09476,026,0001,006,0002,113,536
4Jul 15, 2026 18:329,29186,691,54376,110,0001,006,0002,113,536
5Jul 15, 2026 18:329,29786,766,11276,166,0001,006,0002,113,536
6Jul 15, 2026 18:329,35887,241,54676,624,0001,052,0002,113,536
7Jul 15, 2026 18:329,40087,668,28676,821,0001,202,0002,113,536
8Jul 15, 2026 18:329,53388,721,57177,923,0001,202,0002,113,536
9Jul 15, 2026 18:329,60790,702,19678,733,0001,008,0002,113,536