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 24, 2026 13:30SneedSneedScore: 42,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 13:3042,872379,789,987353,840,0001,999,0002,269,184
2Feb 24, 2026 13:3042,877376,183,554354,884,000999,0002,383,872
3Feb 24, 2026 13:3042,881379,835,719354,912,000999,0002,289,664
4Feb 24, 2026 13:3042,882379,659,127354,919,000999,0002,265,088
5Feb 24, 2026 13:3042,889378,862,974353,978,0001,999,0002,523,136
6Feb 24, 2026 13:3042,895381,689,480355,030,0001,000,0002,285,568
7Feb 24, 2026 13:3042,898380,185,419354,052,0002,000,0002,285,568
8Feb 24, 2026 13:3043,060383,359,984356,398,0001,001,0002,285,568
9Feb 24, 2026 13:3043,083382,738,078354,595,0002,996,0002,285,568