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 18, 2026 23:51Kevin HeaveyKevin HeaveyScore: 3,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 23:573,59339,474,28728,712,0001,112,0002,113,536
2Jul 18, 2026 23:573,60639,574,56928,783,0001,153,0002,113,536
3Jul 18, 2026 23:573,85542,178,14230,855,0001,143,0002,113,536
4Jul 18, 2026 23:573,86541,781,14330,924,0001,159,0002,113,536
5Jul 18, 2026 23:573,87141,797,56230,995,0001,135,0002,113,536
6Jul 18, 2026 23:573,87641,837,12430,942,0001,232,0002,113,536
7Jul 18, 2026 23:573,87741,789,41931,032,0001,148,0002,113,536
8Jul 18, 2026 23:573,90642,674,72031,239,0001,185,0002,113,536
9Jul 18, 2026 23:573,90742,006,38831,309,0001,124,0002,113,536