In this talk, we report on an implementation of ANewDsc on top of the RS root isolator. At the current stage, RS is the most efficient realization of the classical Descartes method, and also constitutes the default real root solver for polynomials in Maple. We describe several crucial design changes within ANewDsc as well as within RS that have led to a high-performance implementation without harming the theoretical complexity of the underlying algorithm. Testing our implementation on numerous benchmark instances shows that the theoretical gain in performance of ANewDsc over other subdivision methods also transfers into practice. Experiments show that our new implementation outperforms RS by magnitudes for notoriously hard instances with clustered roots. For all other instances, there is almost no overhead due to the integration of additional techniques.