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 20, 2025 07:24sheryllynn24sheryllynn24Score: 15,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 07:2415,319154,632,419126,145,0001,001,0002,265,088
2Sep 20, 2025 07:2415,357151,816,826125,453,0002,007,0002,359,296
3Sep 20, 2025 07:2415,359150,352,227126,473,0001,003,0002,285,568
4Sep 20, 2025 07:2415,384153,488,963126,687,000997,0002,285,568
5Sep 20, 2025 07:2415,396155,165,214126,790,000998,0002,519,040
6Sep 20, 2025 07:2415,399153,396,664126,814,000998,0002,285,568
7Sep 20, 2025 07:2415,411157,889,915125,913,0001,998,0002,285,568
8Sep 20, 2025 07:2415,418153,711,576124,969,0002,999,0002,527,232
9Sep 20, 2025 07:2415,593151,717,245128,422,0001,003,0002,277,376