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 listJan 11, 2025 23:35Ian MckibbenIan MckibbenScore: 43,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 23:3542,966384,358,416354,621,0001,997,0002,281,472
2Jan 11, 2025 23:3543,015379,241,223355,023,0002,000,0002,289,664
3Jan 11, 2025 23:3543,036385,234,583355,196,0002,001,0002,289,664
4Jan 11, 2025 23:3543,085390,142,866354,608,0002,996,0002,281,472
5Jan 11, 2025 23:3543,086391,214,153355,614,0001,997,0002,347,008
6Jan 11, 2025 23:3543,088383,046,554355,636,0001,997,0002,289,664
7Jan 11, 2025 23:3543,090384,788,169355,647,0001,998,0002,289,664
8Jan 11, 2025 23:3543,091383,941,537356,657,000999,0002,506,752
9Jan 11, 2025 23:3543,099382,328,691355,724,0001,998,0002,506,752