In this paper we initiate the study of signed total distance $k$-domatic numbers in graphs and we present its sharp upper bounds.