  In this paper, combining count sketch and maximal weighted residual Kaczmarz
method, we propose a fast randomized algorithm for large overdetermined linear
systems. Convergence analysis of the new algorithm is provided. Numerical
experiments show that, for the same accuracy, our method behaves better in
computing time compared with the state-of-the-art algorithm.
