The stress of a vertex is a node centrality index, which has been introduced by Shimbel (1953). The stress of a vertex in a graph is the number of geodesics (shortest paths) passing through it. In this  paper, we introduce a new topological index for graphs called square root stress sum index using stresses of vertices. Further, we establish some inequalities, prove some results and compute stress-sum index for some standard graphs.