Task: Implement an Optimal Algorithm to Count Divisors of a Number

Task: Implement an Optimal Algorithm to Count Divisors of a Number: a task in Terminal-Lego-15k (Harbor dataset). Your task is to implement a high-performance algorithm that calculates the number of divisors (also called the divisor function or τ(n)) for a given positive integer.