CodingMediumcod-g410

Subject Number theoryLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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) → int

Examples

in[6]out12

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.