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 17:48Kevin HeaveyKevin HeaveyScore: 3,953Success
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 17:553,68740,390,81729,562,0001,047,0002,113,536
2Jul 18, 2026 17:553,75640,955,67430,134,0001,046,0002,113,536
3Jul 18, 2026 17:553,83241,654,08830,769,0001,044,0002,113,536
4Jul 18, 2026 17:553,93042,405,61131,585,0001,042,0002,113,536
5Jul 18, 2026 17:553,95342,662,59931,768,0001,047,0002,113,536
6Jul 18, 2026 17:553,96343,415,09531,850,0001,047,0002,113,536
7Jul 18, 2026 17:554,00143,113,93132,165,0001,045,0002,113,536
8Jul 18, 2026 17:554,08156,541,47132,832,0001,048,0002,117,632
9Jul 18, 2026 17:554,62658,105,40537,120,0001,281,0002,113,536