Are there some algorithms, their time complexity is relatively good, for example polynomial time.
And the correctness of them has high consistency strength.
And these algorithms shouldn’t able to solve an easier proplem.
A non-example: assume ZFC+there are infinitely many woodin cardinals. given natural number n, decide whether $Pi^1_n$ determinacy is true.
The algorithm is simply input n and output true. Although its correctness has very high consistency strength, but this algorithm can solve much easier problem.