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:23caandocaandoScore: 6,152Success
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:236,03676,587,64048,092,0002,003,0002,285,568
2Oct 23, 2025 19:236,04773,883,32049,183,0001,003,0002,265,088
3Oct 23, 2025 19:236,07976,532,03749,445,0001,009,0002,265,088
4Oct 23, 2025 19:236,15271,838,15750,062,0001,001,0002,285,568
5Oct 23, 2025 19:236,16975,853,95549,193,0002,007,0002,265,088
6Oct 23, 2025 19:236,20372,391,72249,467,0002,019,0002,519,040