I tried to calculate the number of groups of order $2058=2\times3\times 7^3$ and aborted after more than an hour. I used the (apparently slow) function $ConstructAllGroups$ because $NrSmallGroups$ did not give a result.
The number $n=2058$ is (besides $2048$) the smallest number $n$, for which I do not know $gnu(n)$
The highest exponent is $3$, so it should be possible to calculate $gnu(2058)$ in a reasonable time.
What is $gnu(2058)$. If a result is too difficult, is it smaller than ,larger than or equal to $2058$ ?
$\mathtt{ConstructAllGroups(2058)}$ completed for me in a little over two hours (8219 seconds on a 2.6GHz machine) and returned a list of $91$ groups, which confirms Alexander Hulpke's results.
Many serious computations in group theory take a long time - in some cases I have left programs running for months and got useful answers at the end! So this does not rate for me as a difficult calculation.