【解決方法】正しいコードを教えてください

Consider a scenario with 'T' test cases. Hence, for each test case 'ti', let there be any positive number 'n'. Since, factorial of a number 'n' can be computed through the following formula:

n! = n × (n − 1) × ... × 3 × 2 × 1

Find a value, named as 'result', by adding all the digits received through a factorial of a number 'n'.

Input Format

The First line contains T, the number of test cases, followed by integer 'n'.

Constraints

1<=T<=1000

1<=n<=1000000

Output Format

Sum of the digits of a computed factorial value.

私が試したこと：

unsigned int factorial(unsigned int n)
{
    int res = 1, i;
    for (i = 2; i <= n; i++)
        res *= i;
    return res;
}
 
int main()
{
    int num = 5;
    printf(
        "Factorial of %d is %d", num, factorial(num));