The Challenge is to perform very fast unique function for a long and wide array.
The data is small integer representing data permutations of items like DNA and Rubik's cube faces.
Input: Array of uint8 of dimensions (m, 48) with values 0:3
Output: Array Equivalent to unique(A,'rows')
1) Columns can be merged to form a reduced number of columns 2) Unique has the option to provide an Array and a sorting Index