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 6, 2025 11:19Rajarshi BasuRajarshi BasuScore: 7,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 11:196,91088,658,85655,343,0002,012,0002,281,472
2Dec 6, 2025 11:196,92379,229,75657,460,00002,416,640
3Dec 6, 2025 11:196,98883,325,36656,001,0002,000,0002,273,280
4Dec 6, 2025 11:197,07987,317,68957,764,000995,0002,281,472
5Dec 6, 2025 11:197,08384,206,96256,799,0001,992,0002,379,776
6Dec 6, 2025 11:197,13883,585,29957,239,0002,008,0002,265,088