A practical implementation of the Diverting Fast Radix (DRF) Algorithm is presented. The theoretical improvements over classical radix sorts are outlined and implementation details are specified to demonstrate that the algorithm is competitive with the state of the art. The effectiveness of this implementation of the DFR algorithm is shown by considering a variety of standard distributions of data and input sizes as well as its effectiveness on some example real-world Big Data.