In this paper, we provide the almost-sure convergence and the asymptotic normality of a smooth version of the Robbins–Monro algorithm for the quantile estimation. A Monte Carlo simulation study shows that our proposed method works well within the framework of a data stream.