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 21, 2025 23:48hochohochoScore: 225,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2025 23:48225,4921,900,100,5441,823,592,00047,989,0002,277,376
2Oct 21, 2025 23:48225,5151,900,312,5141,797,825,00073,951,0002,285,568
3Oct 21, 2025 23:48225,5241,902,390,0921,791,898,00079,950,0002,285,568
4Oct 21, 2025 23:48225,5311,895,944,3751,796,950,00074,956,0002,277,376
5Oct 21, 2025 23:48225,5481,896,196,6381,793,088,00078,959,0002,285,568
6Oct 21, 2025 23:48225,5521,901,395,2831,801,115,00070,965,0002,519,040
7Oct 21, 2025 23:48225,6981,897,461,8271,809,320,00063,975,0002,260,992
8Oct 21, 2025 23:48225,7611,896,939,5231,806,861,00066,957,0002,519,040
9Oct 21, 2025 23:48226,0851,899,905,5081,818,523,00057,984,0002,519,040