The average run length (ARL), the average number of in-control signals before an out-of-control signal occurs, is a critical measure of the performance of a control chart. Various methods have been explored for estimating the ARL, including Markov chain-based approximation, integration method, and the Monte Carlo method, especially for time-dependent charting statistics. Although computationally expensive, the Monte Carlo method is generic and applicable to all control charts. Typically, it involves choosing the maximum run length in advance and discarding iterations that fail to produce out-of-control signals to accommodate some unusually lengthy runs. However, these discarded runs provide information for estimating the run length. This paper introduces a new Monte Carlo approximation that retains failed iterations as Type I censored observations for ARL estimation. Our approach relies on the memoryless expectation of the run length distribution to have a simple and efficient ARL estimator. This assumption is necessary for mean estimation in Type I censored data and aligns with existing ARL approximations used in popular control charts like Shewhart, exponentially weighted moving average (EWMA), and cumulative sum (CUSUM) charts. Numerical simulations demonstrate our method’s computational and statistical efficiency across the mean, median, EWMA, and CUSUM charts.