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 listFeb 14, 2026 12:51Juraj ZelmanJuraj ZelmanScore: 61,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 12:5161,427537,304,912508,845,000999,0002,359,296
2Feb 14, 2026 12:5161,461536,020,023509,123,0001,000,0002,359,296
3Feb 14, 2026 12:5161,477530,589,086509,258,0001,000,0002,293,760
4Feb 14, 2026 12:5161,489533,644,556509,358,0001,000,0002,359,296
5Feb 14, 2026 12:5161,518544,036,401509,597,000999,0002,293,760
6Feb 14, 2026 12:5161,620542,545,392509,449,0001,997,0002,293,760
7Feb 14, 2026 12:5161,620540,162,944510,449,0001,000,0002,293,760
8Feb 14, 2026 12:5161,632537,592,114510,549,000999,0002,285,568
9Feb 14, 2026 12:5161,672537,338,833509,875,0001,999,0002,359,296