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:47sheryllynn24sheryllynn24Score: 6,630Success
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:476,50279,585,39552,964,000999,0002,285,568
2Sep 26, 2025 17:476,50680,921,20851,999,0001,999,0002,285,568
3Sep 26, 2025 17:476,51076,528,92952,031,0002,001,0002,285,568
4Sep 26, 2025 17:476,63081,635,40053,030,0002,001,0002,285,568
5Sep 26, 2025 17:476,63284,861,90954,045,0001,000,0002,285,568
6Sep 26, 2025 17:476,67783,005,30554,415,0001,007,0002,265,088