Univariate polynomial root-finding is a classical subject, still important for modern comput-ing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial has no nonreal roots, but for high degree polynomials, nonreal roots are typically much more numerous than the real ones. The challenge is known for long time, and the subject has been intensively studied. Nevertheless, we obtain dramatic acceleration of the known algorithms by applying new combinations of the known algorithms and properly exploiting the geometry of the complex plane. We confirm the efficiency of the proposed real root-finders by both their Boolean complexity estimates and the results of their numerical tests with benchmark polynomials. In particular in our tests the num-ber of iterations required for convergence of our algorithms grew very slowly as we increased the degree of the polynomials from 64 to 1024. Our techniques is very simple, and we point out their further modifications that promise to produce efficient complex polynomial root-finders.