Faster
When set, the sort will be faster. This is done by using a faster sorting algorithm that is not stable (i.e. the order of identical values is not guaranteed to be preserved). It has the added side benefit that the sort will also be in-place (i.e. does not allocate), which is useful for sorting large files that will otherwise NOT fit in memory using the default allocating stable sort. For --random sorts, this means using an alternative random number generator (RNG) that uses the much faster Wyrand algorithm instead of the ChaCha algorithm used by the standard RNG.