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 22, 2025 08:35hochohochoScore: 214,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 08:35214,5711,808,736,0931,717,979,00062,962,0002,285,568
2Oct 22, 2025 08:35214,5761,808,503,1131,727,014,00053,969,0002,523,136
3Oct 22, 2025 08:35214,5811,810,599,7301,713,058,00067,962,0002,519,040
4Oct 22, 2025 08:35214,6751,807,832,4781,727,840,00053,963,0002,265,088
5Oct 22, 2025 08:35214,7001,806,448,2521,700,052,00081,954,0002,289,664
6Oct 22, 2025 08:35214,7261,809,081,7631,716,251,00065,971,0002,285,568
7Oct 22, 2025 08:35214,7461,805,268,3541,728,409,00053,981,0002,269,184
8Oct 22, 2025 08:35214,7951,810,841,9541,710,847,00071,951,0002,277,376
9Oct 22, 2025 08:35214,9021,816,067,4001,710,741,00072,946,0002,510,848