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 listJul 22, 2026 21:52Kevin HeaveyKevin HeaveyScore: 61,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 21:5260,716513,917,045502,946,0001,002,0002,113,536
2Jul 22, 2026 21:5260,738514,066,861503,130,0001,002,0002,113,536
3Jul 22, 2026 21:5260,899515,293,351504,461,0001,002,0002,113,536
4Jul 22, 2026 21:5261,363519,214,147508,312,0001,004,0002,113,536
5Jul 22, 2026 21:5261,461522,257,249509,125,0001,003,0002,113,536
6Jul 22, 2026 21:5261,622525,647,955510,466,0001,002,0002,113,536
7Jul 22, 2026 21:5261,700524,542,500511,109,0001,003,0002,113,536
8Jul 22, 2026 21:5261,731522,263,410511,372,0001,002,0002,113,536
9Jul 22, 2026 21:5261,946524,042,376512,123,0002,034,0002,113,536