For a wide range of phenomena, current computational ability does not always allow for fully atomistic simulations of high-dimensional molecular systems to reach time scales of interest. Coarse-graining (CG) is an established approach to alleviate the impact of computational limits while retaining the same algorithms used in atomistic simulations. It is of importance to understand how algorithms such as Langevin integrators perform on nontrivial CG molecular systems, and in particular how large of an integration time step can be used without introducing unacceptable amounts of error into averaged quantities of interest. To investigate this, we examined three different Langevin integrators on a CG polymer melt: the recently developed BAOAB method by Leimkuhler and Matthews [17], the Grønbech-Jensen and Farago method [12], or G-JF, and the frequently used Brünger-Brooks-Karplus integrator [6], also known as BBK. We compute and analyze key statistical properties for each. Our results indicate that the three integrators perform similarly when using a small friction parameter; however, outside of this regime the use of large integration steps produces significant deviations from the predicted diffusivity and steady-state distributions for all integration methods examined with the exception of G-JF.2010 Mathematics Subject Classification. 82C31; 82C80; 82D15.