The Tetris Cube is a three dimensional puzzle. It consists of 12 pieces. There are three colors, and there are four pieces of every color. All pieces are distinct. The goal of the puzzle is to arrange all pieces in a 4x4x4 box. We have developed a Haskell solver that uses bit manipulation and parallel computing for fast retrieval of all solutions. On a 2 GHz machine with 4 cores the program needs about an hour to find all 9839 solutions.