Given an array of integers nums and an integer k, determine the maximum GCD sum among all subarrays with a length of at least k.

The GCD sum of a subarray is defined as the greatest common divisor of all elements in that subarray multiplied by the sum of all elements in that subarray.

Return the maximum GCD sum that can be obtained.

Note: A subarray is a contiguous sequence of elements within an array.

Constraints:

• n $==$ nums.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^6$

• $1 \leq$ k $\leq$ n

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.