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 2, 2026 07:02Victor MerckléVictor MerckléScore: 4,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 07:034,12342,142,92833,119,0001,103,0002,117,632stderr
2Jul 2, 2026 07:034,13542,248,31533,236,0001,085,0002,117,632stderr
3Jul 2, 2026 07:034,13742,316,88533,239,0001,105,0002,117,632stderr
4Jul 2, 2026 07:034,16242,497,22333,530,0001,021,0002,117,632stderr
5Jul 2, 2026 07:034,18342,652,08233,697,0001,024,0002,117,632stderr
6Jul 2, 2026 07:034,19442,772,52933,789,0001,025,0002,117,632stderr
7Jul 2, 2026 07:034,21042,844,26733,915,0001,035,0002,117,632stderr
8Jul 2, 2026 07:034,29543,564,40234,630,0001,025,0002,117,632stderr
9Jul 2, 2026 07:034,31743,733,90734,815,0001,024,0002,117,632stderr