The detour index of a connected graph is defined as the sum of detour distances between all unordered pairs of vertices. We determine the $n$-vertex unicyclic graphs whose vertices on its unique cycle all have degree at least three with the first, the second and the third smallest and largest detour indices respectively for $n\geq7$.