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 listFeb 19, 2026 23:08Serhii SakhnoSerhii SakhnoScore: 79,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 20:3179,742687,142,013659,856,0001,999,0002,527,232
2Feb 19, 2026 23:0879,746692,862,128659,895,0001,999,0002,277,376
3Feb 19, 2026 20:3179,770685,154,259661,088,0001,000,0002,277,376
4Feb 19, 2026 20:3179,778691,513,687660,161,0002,000,0002,531,328
5Feb 19, 2026 20:3179,787682,520,388661,236,0001,000,0002,383,872
6Feb 19, 2026 20:3179,816688,630,258660,474,0001,998,0002,363,392
7Feb 19, 2026 20:3179,856689,758,540659,802,0002,999,0002,277,376
8Feb 19, 2026 20:3179,897688,088,466661,149,0002,000,0002,281,472
9Feb 19, 2026 23:0879,969693,173,280660,744,0002,998,0002,527,232
10Feb 19, 2026 20:3179,996686,661,252662,969,000999,0002,277,376
11Feb 19, 2026 23:0880,044696,197,157659,364,0005,002,0002,273,280
12Feb 19, 2026 20:3180,155690,080,601663,291,0001,997,0002,281,472