Given an integer array nums, return the sum of the divisors of all integers in nums that have exactly $4$ divisors. If an integer has more or fewer than $4$ divisors, do not include its divisors in the sum. If no such integer exists in the array, return $0$.

Constraints:

• $1 \leq$ nums.length $\leq 10^4$

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

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.