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 22, 2025 18:57Mark R BestMark R BestScore: 59,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 18:5758,989518,990,643437,650,00051,958,0002,289,664
2Dec 22, 2025 18:5758,994515,330,309428,691,00060,956,0002,297,856
3Dec 22, 2025 18:5758,997518,309,064442,706,00046,968,0002,289,664
4Dec 22, 2025 18:5759,062512,708,983430,188,00060,026,0002,289,664
5Dec 22, 2025 18:5759,076513,185,345441,297,00049,033,0002,297,856
6Dec 22, 2025 18:5759,147519,380,093436,929,00053,991,0002,285,568
7Dec 22, 2025 18:5759,230517,874,537434,652,00056,954,0002,289,664
8Dec 22, 2025 18:5759,294513,647,891438,123,00054,015,0002,301,952
9Dec 22, 2025 18:5759,300517,188,885437,171,00055,021,0002,424,832