Repeating Cycle of Modulus

Is there a efficient method to find the value of 1111..ⁿmod M?

One can always use repeated squaring to find

10⁰mod M + 10¹mod M + 10²mod M + 10³mod M + ...10ⁿmod M

Is there any faster method than this?