We introduced and analyzed two novel gossip algorithms for rank and trimmed means estimation, proving convergence rates of $\mathcal{O}(1/t)$.