<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:
        mapp=defaultdict(list) # [cnt,sum]
        ans=0
        for ele in nums:
            cnt_div=0
            # cnt_divisors for each elements
            sum_div=0
            i=1
            if ele in mapp:
                if mapp[ele][0]==4:
                    ans+=mapp[ele][1]
                continue
            while(i*i<=ele):
                if(ele%i==0):
                    first=i
                    second=ele//i
                    if first==second:
                        cnt_div+=1
                        sum_div+=first
                    else:
                        cnt_div+=2
                        sum_div+=first+second
                i+=1
            mapp[ele].append(cnt_div)
            mapp[ele].append(sum_div)
            if cnt_div==4:
                ans+=sum_div
        return ans
18800