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 16:38Kevin HeaveyKevin HeaveyScore: 3,917Success
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 16:503,73740,862,04729,972,0001,050,0002,113,536
2Jul 18, 2026 16:503,77641,171,85930,298,0001,047,0002,113,536
3Jul 18, 2026 16:503,89842,147,70831,311,0001,048,0002,113,536
4Jul 18, 2026 16:503,91442,305,72131,439,0001,049,0002,113,536
5Jul 18, 2026 16:503,91742,380,53331,469,0001,046,0002,113,536
6Jul 18, 2026 16:503,94943,944,65531,731,0001,049,0002,113,536
7Jul 18, 2026 16:503,94943,811,84631,735,0001,048,0002,113,536
8Jul 18, 2026 16:503,99344,833,66832,103,0001,046,0002,113,536
9Jul 18, 2026 16:504,00943,728,53432,231,0001,045,0002,113,536