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 21:50Daniel MastalerzDaniel MastalerzScore: 5,941Success
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 21:505,88376,872,08344,840,0003,985,0002,306,048
2Feb 19, 2026 21:505,88472,006,14245,850,0002,990,0002,322,432
3Feb 19, 2026 21:505,90676,406,02645,015,0004,001,0002,265,088
4Feb 19, 2026 21:505,94173,925,81546,293,0003,019,0002,265,088
5Feb 19, 2026 21:506,03273,929,90447,065,0003,004,0002,375,680
6Feb 19, 2026 21:506,07073,687,52947,355,0003,022,0002,273,280