I got a head start on this one, since I gave a recursive solution in the original thread. But I've never golfed before, so this is likely to go down in flames quickly... I believe it scores 110 as is (somewhat golfed, but probably not optimally).

sub o {
$q=join'',@{$_[0]};
sort {$i=0;
{index($q,substr($a,$i,1))<=>index($q,substr($b,$i,1))or($i++,redo)}}@
+{$_[1]}
}
[download]

Update: Oof... difficulties is a nice way of putting it. A conditional statement fixes that, probably more cleanly than checking the string length repeatedly. Up to 125, I think--but then, I've already been clobbered.

sub o {
$q=join'',@{$_[0]};
sort {$a cmp$b?do{$i=0;{index($q,substr($a,$i,1))<=>index($q,substr($b
+,$i,1))or($i++,redo)}}:0
}@{$_[1]}
}
[download]