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 listSep 12, 2024 14:39Dmitrii KravchenkoDmitrii KravchenkoScore: 43,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 14:3943,314388,929,340358,507,0001,001,0002,281,472
2Sep 12, 2024 14:3943,576388,981,756359,679,0001,998,0002,281,472
3Sep 12, 2024 14:3943,582390,711,394360,733,000999,0002,281,472
4Sep 12, 2024 14:3943,595389,438,288360,842,000999,0002,281,472
5Sep 12, 2024 14:3943,612396,864,435359,980,0001,999,0002,281,472
6Sep 12, 2024 14:3943,613384,635,210359,993,0001,999,0002,281,472
7Sep 12, 2024 14:3943,640387,094,515361,213,0001,000,0002,277,376
8Sep 12, 2024 14:3943,656394,277,016361,346,0001,000,0002,281,472
9Sep 12, 2024 14:3943,666388,364,052361,423,0001,001,0002,355,200