PLEASE READ THIS: The regular karatsuba algorithm has a runtime of $($n$^$log$2(3)).$ but since these numbers are repeating digits $($ex$.44445555)$ it is more specific than the regular karatsuba algorithm meaning we can get a runtime which is better than $($n$^$log$2(3)).$ So develop one that has a runtime of O$($n$)$ and not O$($n$^$log$2(3)).$

please don't use chatgpt or existing answers thank you.