<p>Given an integer array <code>nums</code>, return <em>the sum of divisors of the integers in that array that have exactly four divisors</em>. If there is no such integer in the array, return <code>0</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [21,4,7]
<strong>Output:</strong> 32
<strong>Explanation:</strong> 
21 has 4 divisors: 1, 3, 7, 21
4 has 3 divisors: 1, 2, 4
7 has 2 divisors: 1, 7
The answer is the sum of divisors of 21 only.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [21,21]
<strong>Output:</strong> 64
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,4,5]
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution:
    def sumFourDivisors(self, nums: List[int]) -> int:
        summing = defaultdict(int)
        valCount = defaultdict(int)
        vals = defaultdict(int)
        for i in nums:
            if valCount[i] == 0:
                for j in range(1, int(sqrt(i)) + 1):
                    if i % j == 0:
                        summing[i] += j
                        vals[i] += j
                        valCount[i] += 1
                        if j != (i // j):
                            summing[i] += (i // j)
                            vals[i] += (i // j)
                            valCount[i] += 1
            else:
                summing[i] += vals[i]
        res = 0
        for i, j in valCount.items():
            if j == 4:
                res += summing[i]
        return res

18900