Sum of divisors
Given an integer n (1 <= n <= 1e12), return the sum of all positive divisors of n (including 1 and n itself). For example divisors of 28 are 1,2,4,7,14,28 summing to 56. Use the multiplicative formula over the prime factorization; enumerating all divisors up to n would be far too slow at the upper bound.
Implement
sum_of_divisors(n: int) → intExamples
in
[6]out12What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[6]12not run yetsample