Card sorters are not linear time. They're number of cards x number of columns of sort key. Sort keys, if unique, have to have size O(log N), so card sorters are O(N log N), as you'd expect.

You can beat O(N log N) with a radix-like sort (SyncSort, the first software patent, shows how), but you need more bins than a card sorter has.