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 16:07sheryllynn24sheryllynn24Score: 8,348Success
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 16:078,31294,086,70267,992,000999,0002,265,088
2Sep 26, 2025 16:078,31498,908,66168,005,0001,000,0002,285,568
3Sep 26, 2025 16:078,32396,932,51767,076,0002,002,0002,523,136
4Sep 26, 2025 16:078,32791,982,41268,111,0001,001,0002,265,088
5Sep 26, 2025 16:078,32894,082,12068,122,0001,001,0002,519,040
6Sep 26, 2025 16:078,34594,719,02967,255,0002,007,0002,285,568
7Sep 26, 2025 16:078,348101,217,56567,284,0002,008,0002,285,568
8Sep 26, 2025 16:078,36596,747,35867,416,0002,012,0002,367,488
9Sep 26, 2025 16:078,36698,554,37667,422,0002,012,0002,277,376
10Sep 26, 2025 16:078,48996,780,28269,450,0001,006,0002,367,488
11Sep 26, 2025 16:078,516101,769,99669,689,000995,0002,285,568
12Sep 26, 2025 16:078,523100,058,24869,743,000996,0002,285,568