We study the run length function for intermittent maps. In particular, we show that the longest consecutive zero digits (resp. one digits) having a time window of polynomial (resp. logarithmic) length. Our proof is relatively elementary in the sense that it only relies on the classical Borel-Cantelli lemma and the polynomial decay of intermittent maps. Our results are compensational to the Erdős-Rényi law obtained by Denker and Nicol in [8]. * Corresponding author, and every author contributes equally.

No abstract