I am talking about this: A result of the unit state query with one unit opened to see the orders. All other units have the same order, each with a copy of this array: Each single unit has that full array of all other units. So n^2 elements. Make n 500 or more and it'll take a while to process multiple hundred thousand elements. It's only IDs, but from how the performance reacts I am pretty sure there is some code in a perf critical position that iterates all these arrays one by one, effective iterating n^2 elements. When n is above 200-300 it starts to become problematic. Not to mention the player might give multiple orders to the group using shift. Each of them again will result in n^2 elements added. Thanks!