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 18, 2025 11:26AlexAlexScore: 52,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2025 11:2652,535457,339,679432,042,0004,000,0002,277,376
2Feb 18, 2025 11:2652,577462,138,686435,390,0001,000,0002,281,472
3Feb 18, 2025 11:2652,606471,210,565434,628,0001,998,0002,277,376
4Feb 18, 2025 11:2652,607463,025,869435,642,000999,0002,277,376
5Feb 18, 2025 11:2652,608461,322,975434,645,0001,998,0002,269,184
6Feb 18, 2025 11:2652,613458,442,322433,693,0002,997,0002,277,376
7Feb 18, 2025 11:2652,632459,746,321433,851,0002,998,0002,277,376
8Feb 18, 2025 11:2652,649468,101,989434,990,0001,999,0002,277,376
9Feb 18, 2025 11:2653,327471,031,222440,618,0001,998,0002,273,280