Mbpp/123

def amicable_numbers_sum(limit: int) -> int:
    """
    Sum all amicable numbers from 1 to a specified number (inclusive).
    Two numbers a and b are amicable if the sum of proper divisors of a equals b,
    and the sum of proper divisors of b equals a, with a != b.
    """
    if limit < 2:
        return 0

    # Sieve to compute sum of proper divisors for all numbers up to limit
    sum_div = [0] * (limit + 1)
    for i in range(1, limit // 2 + 1):
        for j in range(i * 2, limit + 1, i):
            sum_div[j] += i

    total = 0
    # Find

• [999]

• [10000]