Depression filling is a critical step in distributed hydrological modeling using digital elevation models (DEMs). The traditional PriorityâFlood (PF) approach is widely used due to its relatively high efficiency when dealing with a smallâsized DEM. However, it seems inadequate and inefficient when dealing with large highâresolution DEMs. In this work, we examined the relationship between the PF algorithm calculation process and the topographical characteristics of depressions, and found significant redundant calculations in the local microârelief areas in the conventional PF algorithm. As such calculations require more time when dealing with large DEMs, we thus propose a new variant of the PF algorithm, wherein redundant points and calculations are recognized and eliminated based on the local microârelief waterâflow characteristics of the depressionâfilling process. In addition, depressions and flatlands were optimally processed by a quick queue to improve the efficiency of the process. The proposed method was applied and validated in eight case areas using the Shuttle Radar Topography Mission digital elevation model (SRTMâDEM) with 1 arcâsecond resolution. These selected areas have different data sizes. A comparative analysis among the proposed method, the Wang and Liuâbased PF, the improved Barnesâbased PF, the improved Zhouâbased PF, and the Planchon and Darboux (P&D) algorithms was conducted to evaluate the accuracy and efficiency of the proposed algorithm. The results showed that the proposed algorithm is 43.2% (maximum) faster than Wang and Liu's variant of the PF method, with an average of 31.8%. In addition, the proposed algorithm achieved similar performance to the improved Zhouâbased PF algorithm, though our algorithm has the advantage of being simpler. The optimal strategies using the proposed algorithm can be employed in various landforms with high efficiency. The proposed method can also achieve good depression filling, even with large amounts of DEM data.