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 listDec 3, 2025 14:57Rajarshi BasuRajarshi BasuScore: 12,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 14:5711,779129,214,46697,765,00002,289,664
2Dec 3, 2025 14:5711,785120,687,95696,807,0001,008,0002,490,368
3Dec 3, 2025 14:5711,789123,838,41695,849,0001,996,0002,289,664
4Dec 3, 2025 14:5712,062125,840,27999,110,0001,001,0002,289,664
5Dec 3, 2025 14:5712,065123,327,27598,140,0002,002,0002,486,272
6Dec 3, 2025 14:5712,105123,674,51099,469,0001,004,0002,289,664