But even if we have this super sorting machine (the one Acidfire use at job), how will you manage to know that you have a "K" and not an "A" (for example) since they both have the same size. If you put all the keys together, you need to get one of each in each bag instead of a number X of the same item. The problem seems really different to me unless I missed something big!
What would be nice is to have a big cone (pointing down) and with a lot of containers all around the big circle at the top of the cone. In each container you put all the keys from 1 specific key (so one container for the letter A, one for the letter B, etc.) and then you have a big button that, when you press it, lets 1 key from each container drop in the middle of the cone, and at the base of the cone you have a bag where the keys drop. So basically, you push the button, 1 key of each drops in the bag, you close the bag and put a new one.
The problem is that you will need as many containers as there are keys, and as many opening system as there are containers, unless you make one with like X number of containers and you do you bags with X keys at a time, them once you sorted all the keys from the X containers, you start again with X different keys, putting the bags with the previous keys again.
And then not all the keys are the same size, so you need a different opening for each size.