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 23:21Kevin HeaveyKevin HeaveyScore: 3,699Success
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 23:223,64840,125,78429,127,0001,158,0002,113,536
2Jul 22, 2026 23:223,65840,174,94229,205,0001,158,0002,113,536
3Jul 22, 2026 23:223,66440,222,91729,258,0001,154,0002,113,536
4Jul 22, 2026 23:223,68440,473,98229,525,0001,055,0002,113,536
5Jul 22, 2026 23:223,69940,689,69629,508,0001,197,0002,113,536
6Jul 22, 2026 23:223,71040,647,75529,625,0001,174,0002,113,536
7Jul 22, 2026 23:223,79141,355,51530,280,0001,189,0002,113,536
8Jul 22, 2026 23:223,88942,105,54531,124,0001,158,0002,113,536
9Jul 22, 2026 23:223,92442,731,52531,371,0001,200,0002,113,536