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 12, 2026 00:03olliecrowolliecrowScore: 7,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 00:036,77382,861,48951,201,0005,019,0002,437,120
2Feb 12, 2026 00:036,79086,772,62453,342,0003,019,0002,285,568
3Feb 12, 2026 00:036,82490,290,85454,618,0002,022,0002,297,856
4Feb 12, 2026 00:037,20791,675,56856,828,0002,990,0002,457,600
5Feb 12, 2026 00:037,20786,083,66257,826,0001,994,0002,478,080
6Feb 12, 2026 00:037,23584,939,12558,050,0002,001,0002,293,760