Set up "bins" such that the expected number of data points in each bin is greater than 5 (this recommendation is due to the fact that the Chi-square test relies on the central limit theorem, so that results form an approximate multivariate normal distribution).
Then, subtract the expected number of points in each bin from the _actual_ number of points in each bin. Use these differences to form your chi-square statistic (per the wiki page) and then apply the test.
Since you are testing for uniformity, the expected number of points in each bin bill be proportional to either the length or the number of outputs in each bin (depending on if your hash function is continuous or discrete valued, respectively.)