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 4, 2025 13:33Rajarshi BasuRajarshi BasuScore: 8,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:338,800100,747,83471,039,0002,001,0002,490,368
2Dec 4, 2025 13:338,80398,917,93872,065,0001,000,0002,289,664
3Dec 4, 2025 13:338,805103,324,58371,080,0002,002,0002,289,664
4Dec 4, 2025 13:338,981102,707,64474,541,00002,289,664
5Dec 4, 2025 13:338,992102,189,92373,626,0001,008,0002,506,752
6Dec 4, 2025 13:338,997100,717,57273,666,0001,009,0002,289,664