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:58Rajarshi BasuRajarshi BasuScore: 11,920Success
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:5811,673118,513,49994,891,0001,997,0002,490,368
2Dec 3, 2025 14:5811,675125,044,17394,902,0001,997,0002,289,664
3Dec 3, 2025 14:5811,787123,836,01096,838,000998,0002,494,464
4Dec 3, 2025 14:5811,920126,162,21598,933,00002,289,664
5Dec 3, 2025 14:5811,928125,807,56297,003,0002,000,0002,289,664
6Dec 3, 2025 14:5811,930122,613,59597,019,0002,000,0002,289,664