The first author showed that the list chromatic number of every graph with average degree is at least . We prove that for , every -uniform hypergraph in which at least half of the -vertex subsets are contained in at least edges has list chromatic number at least . When is fixed, this is sharp up to a constant factor.