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 12, 2026 16:06Kevin HeaveyKevin HeaveyScore: 3,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 16:113,86441,711,36430,869,0001,209,0002,117,632
2Jul 12, 2026 16:113,86841,727,87730,923,0001,184,0002,117,632
3Jul 12, 2026 16:113,87441,738,97030,945,0001,217,0002,117,632
4Jul 12, 2026 16:113,87541,797,30830,969,0001,198,0002,117,632
5Jul 12, 2026 16:113,88141,847,88231,196,0001,020,0002,117,632
6Jul 12, 2026 16:113,89041,952,65731,269,0001,021,0002,117,632
7Jul 12, 2026 16:113,93342,247,68931,431,0001,216,0002,117,632
8Jul 12, 2026 16:113,93942,388,57131,661,0001,035,0002,117,632
9Jul 12, 2026 16:113,94142,278,16631,669,0001,042,0002,117,632