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 17, 2026 14:18Kevin HeaveyKevin HeaveyScore: 3,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 14:263,66840,297,84529,398,0001,051,0002,113,536
2Jul 17, 2026 14:263,68941,844,46429,578,0001,047,0002,113,536
3Jul 17, 2026 14:263,70140,563,70129,678,0001,047,0002,113,536
4Jul 17, 2026 14:263,70649,936,14229,713,0001,047,0002,113,536
5Jul 17, 2026 14:263,73251,017,79929,921,0001,057,0002,113,536
6Jul 17, 2026 14:263,82042,953,32530,662,0001,046,0002,113,536
7Jul 17, 2026 14:263,82544,319,09030,710,0001,045,0002,113,536
8Jul 17, 2026 14:264,03943,435,05132,369,0001,160,0002,113,536
9Jul 17, 2026 14:264,04054,288,91632,489,0001,046,0002,113,536