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 9, 2025 15:19Serhat ErenSerhat ErenScore: 49,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2025 15:1949,939440,707,479413,496,0001,001,0002,269,184
2Oct 9, 2025 15:1949,950440,783,883414,586,00002,281,472
3Oct 9, 2025 15:1949,964438,263,916413,702,000999,0002,510,848
4Oct 9, 2025 15:1949,967442,292,429412,725,0001,998,0002,269,184
5Oct 9, 2025 15:1949,996439,916,580412,969,0001,999,0002,404,352
6Oct 9, 2025 15:1949,998435,717,056413,987,000999,0002,269,184
7Oct 9, 2025 15:1950,018437,414,937412,150,0003,001,0002,269,184
8Oct 9, 2025 15:1950,043442,276,478414,356,0001,000,0002,404,352
9Oct 9, 2025 15:1950,097442,360,496412,807,0002,998,0002,510,848