Density evolution for LDPC codes predicts asymptotic performance and serves as a practical design tool for designing top performing structures [1]. Many papers advocate the use of exit chart methods and other approximations, proclaiming that density evolution is computationally too intensive. In this paper we show that this is not the case: we present a highly efficient and accurate implementation of density evolution for LDPC codes.