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 8, 2026 06:34Victor MerckléVictor MerckléScore: 5,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 06:355,78657,516,32846,926,0001,104,0002,117,632stderr
2Jul 8, 2026 06:355,79356,245,19046,979,0001,105,0002,117,632stderr
3Jul 8, 2026 06:355,79456,184,01246,923,0001,173,0002,117,632stderr
4Jul 8, 2026 06:355,79456,197,35146,996,0001,099,0002,117,632stderr
5Jul 8, 2026 06:355,79756,166,91046,949,0001,167,0002,117,632stderr
6Jul 8, 2026 06:355,79856,234,17846,973,0001,156,0002,117,632stderr
7Jul 8, 2026 06:355,80056,295,44447,119,0001,028,0002,117,632stderr
8Jul 8, 2026 06:355,80256,222,87046,980,0001,183,0002,117,632stderr
9Jul 8, 2026 06:355,80356,324,08747,013,0001,159,0002,117,632stderr