Find the original challenge here
Given an integer,
Z in the range
-2^31 < Z < 2^31, output the number of digits in that number (in base 10).
You must not use any string functions (in the case of overloading, you must not pass a string into functions which act as both string and integer functions). You are not allowed to store the number as a string.
All mathematical functions are allowed.
You may take input in any base, but the output must be the length of the number in base 10.
Do not count the minus sign for negative numbers. Number will never be a decimal.
Zero is effectively a leading zero, so it can have zero or one digit.
Input > Output -45 > 2 1254 > 4 107638538 > 9 -20000 > 5 0 > 0 or 1 -18 > 2
Shortest code in bytes wins.