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 listOct 23, 2025 19:24caandocaandoScore: 5,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 19:245,88170,092,84547,814,000996,0002,285,568
2Oct 23, 2025 19:245,88579,944,87047,853,000996,0002,260,992
3Oct 23, 2025 19:245,89376,340,27446,919,0001,996,0002,265,088
4Oct 23, 2025 19:245,90771,730,58847,024,0002,001,0002,269,184
5Oct 23, 2025 19:245,90871,551,01447,039,0002,001,0002,269,184
6Oct 23, 2025 19:245,91078,703,13947,049,0002,002,0002,359,296
7Oct 23, 2025 19:245,91274,694,36747,066,0002,002,0002,265,088
8Oct 23, 2025 19:245,91574,959,82947,090,0002,003,0002,285,568
9Oct 23, 2025 19:245,95971,686,95848,447,0001,009,0002,273,280
10Oct 23, 2025 19:246,00675,967,40847,856,0001,994,0002,519,040
11Oct 23, 2025 19:246,01875,886,83347,949,0001,997,0002,514,944
12Oct 23, 2025 19:246,04070,448,25548,129,0002,005,0002,359,296