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 16, 2026 23:36Kevin HeaveyKevin HeaveyScore: 3,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 23:403,69440,500,03629,617,0001,047,0002,113,536
2Jul 16, 2026 23:403,72540,727,37129,868,0001,053,0002,113,536
3Jul 16, 2026 23:403,72641,799,72329,883,0001,051,0002,113,536
4Jul 16, 2026 23:403,73040,712,98529,912,0001,052,0002,113,536
5Jul 16, 2026 23:403,74240,863,63130,017,0001,049,0002,113,536
6Jul 16, 2026 23:403,79041,235,28530,412,0001,048,0002,113,536
7Jul 16, 2026 23:403,84651,793,62730,724,0001,202,0002,113,536
8Jul 16, 2026 23:403,93342,362,30331,602,0001,046,0002,113,536
9Jul 16, 2026 23:404,03143,198,67832,415,0001,047,0002,113,536