The distance energy of a graph \(G\) is the sum of the absolute values of the eigenvalues of the distance matrix of \(G\). The authors derive some lower and some upper bounds for the distance energy of a graph in terms of the entries of the distance matrix, i.e., in terms of the distance between vertices.