Given an integer array nums, return the sum of divisors of the integers in that array that have exactly four divisors.
If there is no such integer in the array, return 0.
 
Example 1:
Input: nums = [21,4,7]
Output: 32
Explanation:
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.

 
Constraints:

1 <= nums.length <= 10^4
1 <= nums[i] <= 10^5

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '\nimport math\n\ndef remove (lst, index):\n    assert lst\n    tail = len (lst) - 1\n    lst[index], lst[tail] = lst[tail], lst[index]\n    lst.pop ()\n\ndef swap_min (lst):\n    if not lst: return\n    argmin = min (range (len (lst)), key = lambda i: lst[i])\n    lst[0], lst[argmin] = lst[argmin], lst[0]\n\ndef find_primes (top):\n    candidates = list (range (2, top))\n    primes = []\n    while candidates:\n        # here, candidates[0] is the least element.\n        latest_prime = candidates[0]\n        primes.append (latest_prime)\n        remove (candidates, 0)\n        for i in range (len (candidates) - 1, -1, -1):\n            if candidates[i] % latest_prime == 0:\n                remove (candidates, i)\n\n        swap_min (candidates)\n        # before continuing, set candidates[0] to be the least element.\n    return primes\n\ndef find_prime_factor (n, primes):\n    for p in primes:\n        if n % p == 0:\n            return p\n\ndef div4 (n, primes, setprimes):\n    if n <= 3:\n        return 0\n    elif n in setprimes:\n        return 0\n    else:\n        p1 = find_prime_factor (n, primes)\n        if p1 is None:\n            return 0\n        p2 = find_prime_factor (n // p1, primes)\n        if p2 is None:\n            p2 = n // p1\n        if p1 * p2 == n and p1 != p2:\n            # success\n            return (1 + p1) * (1 + p2)\n        elif p1 ** 3 == n:\n            # success\n            return (1 + p1) * (1 + p1**2)\n        else:\n            return 0\n\ndef sum_four_divisors (arr):\n    top = math.ceil (math.sqrt (max (arr) + 5))\n    primes = find_primes (top)\n    setprimes = set (primes)\n    return sum (div4 (elem, primes, setprimes) for elem in arr)\n\nclass Solution:\n    def sumFourDivisors(self, nums: List[int]) -> int:\n        return sum_four_divisors(nums)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'sumFourDivisors'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 7854