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 listMar 13, 2026 16:43caandocaandoScore: 5,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 14:435,61971,576,47945,627,0001,013,0002,285,568
2Mar 15, 2026 14:435,64568,138,69944,817,0002,037,0002,482,176
3Mar 15, 2026 14:435,67169,555,07545,069,0002,003,0002,285,568
4Mar 13, 2026 16:435,88970,023,04046,885,0001,995,0002,285,568
5Mar 13, 2026 16:435,90476,890,23148,004,0001,000,0002,285,568
6Mar 13, 2026 16:435,96170,541,06147,460,0002,019,0002,285,568