In this paper, we study the circular choosability recently introduced by Mohar \([5]\) and Zhu \([11]\). In this paper, we show that the circular choosability of planar graphs with girth at least \(\frac{10n+8}{3}\) is at most \(2 + \frac{2}{n}\), which improves the earlier results.