I'm sorry I said "sorting", I meant to say "finding the max". The $sorttok way is still the fastest way to do it and you, once again, ignore an important fact which I've already pointed out specifically to you in the past: sorting N items (Nlog(N) complexity) in the C language is faster than checking two values in a loop (N) in the mirc scripting language. You can't do the comparisons you just did when one algorithm is in C and the other in a higher-level language like mirc script. I won't even bother to benchmark it, as I'm sure of this, but it would perhaps be a good idea if you did.
