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 16, 2026 10:08tch1001tch1001Score: 61,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 10:0861,662533,348,969510,799,000999,0002,392,064
2Feb 16, 2026 10:0861,708541,011,152512,180,00002,273,280
3Feb 16, 2026 10:0861,710534,697,500512,197,00002,273,280
4Feb 16, 2026 10:0861,718531,342,431511,256,0001,000,0002,514,944
5Feb 16, 2026 10:0861,718534,529,496511,260,0001,000,0002,400,256
6Feb 16, 2026 10:0861,723533,505,623511,305,0001,000,0002,404,352
7Feb 16, 2026 10:0861,759536,929,037510,598,0001,998,0002,285,568
8Feb 16, 2026 10:0861,765541,686,010511,654,000999,0002,273,280
9Feb 16, 2026 10:0861,767540,396,244511,665,000999,0002,273,280