We present an algorithm along with implementation details and timing data for computing the Hilbert function of a monomial ideal. Our algorithm is often substantially faster in practice than existing algorithms, and executes in linear time when applied to an initial monomial ideal in generic coordinates. The algorithm generalizes to compute multi-graded Hilbert functions.
