You're right.
I've added a note on string ordering.

I think it can be closed now.

I will be happy to help you, but don't want to kill all the fun with this kata, not yet.
I did not test your solution, but it can be that it's not sorting what should be sorted.
And, in random tests, do you get errors, or timeouts?

That was a great journey through modular arithmetics. Thank you.

I did not think of it as a puzzle, rather an optimization of naive solution.
And you're right, it was hard to realize the goal. Hope it's a bit better now.

It would be nice to have some random tests (to prevent hardcoding), and maybe shifting with very large values, or negative ones.

I didn't mean to change the tests, but the code snippet of initial solution.

C# version expects result as int[] in tests, but code snippet defines return value as List<int>.
It would be much better, especially for beginners, if the code snippet suits the tests.

Can you post some sketch of your code, or pseudocode of your solution, so I'll try to help. There is a lot of space for optimalization in this problem, but I'd like to know where to start.