Compiling the votes of a subelectorate is a well-known problem in computational social choice. The goal is to store the information contained in the votes cast by a subelectorate in a space-efficient way, such that when the rest of the votes become available, the winners can be accurately ascertained. This problem has been studied for single-winner voting rules. We provide a comprehensive compilation complexity landscape for several ordinal and approval-based multi-winner voting rules.