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 listSep 26, 2025 17:25sheryllynn24sheryllynn24Score: 6,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 17:256,49878,813,68151,934,0001,997,0002,265,088
2Sep 26, 2025 17:256,49879,681,32051,935,0001,997,0002,519,040
3Sep 26, 2025 17:256,49982,923,01151,942,0001,997,0002,285,568
4Sep 26, 2025 17:256,50085,780,92651,956,0001,998,0002,285,568
5Sep 26, 2025 17:256,50478,726,89851,983,0001,999,0002,265,088
6Sep 26, 2025 17:256,50883,519,49952,013,0002,000,0002,285,568
7Sep 26, 2025 17:256,50879,586,08652,019,0002,000,0002,285,568
8Sep 26, 2025 17:256,51184,765,19853,039,0001,000,0002,285,568
9Sep 26, 2025 17:256,51479,714,59152,067,0002,002,0002,285,568
10Sep 26, 2025 17:256,63081,148,32454,032,0001,000,0002,383,872
11Sep 26, 2025 17:256,63884,993,12853,095,0002,003,0002,285,568
12Sep 26, 2025 17:256,65283,011,70053,202,0002,007,0002,285,568