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 9, 2026 06:29Victor MerckléVictor MerckléScore: 20,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 06:3118,178159,088,253149,780,0001,099,0002,117,632stderr
2Jul 9, 2026 06:3118,333160,415,345151,066,0001,104,0002,117,632stderr
3Jul 9, 2026 06:3119,907174,012,547163,980,0001,252,0002,117,632stderr
4Jul 9, 2026 06:3120,079175,512,575165,656,0001,007,0002,117,632stderr
5Jul 9, 2026 06:3120,111175,174,019165,808,0001,121,0002,117,632stderr
6Jul 9, 2026 06:3120,117175,058,568165,876,0001,102,0002,117,632stderr
7Jul 9, 2026 06:3120,199175,927,371166,390,0001,265,0002,117,632stderr
8Jul 9, 2026 06:3120,235176,050,360166,741,0001,212,0002,117,632stderr
9Jul 9, 2026 06:3120,279176,549,850167,204,0001,118,0002,117,632stderr