Counting polycubes without the dimensionality curse

d -dimensional polycubes are the generalization of planar polyominoes to higher dimensions. That is, a d -D polycube of size n is a connected set of n cells of a d -dimensional hypercubic lattice, where connectivity is through ( d − 1 ) -dimensional faces of the cells. Computing A d ( n ) , the number of distinct d -dimensional polycubes of size n , is a long-standing elusive problem in discrete geometry. In a previous work we described the generalization from two to higher dimensions of a polyomino-counting algorithm of Redelmeier [D.H. Redelmeier, Counting polyominoes: Yet another attack, Discrete Math. 36 (1981) 191–203]. The main deficiency of the algorithm is that it keeps the entire set of cells that appear in any possible polycube in memory at all times. Thus, the amount of required memory grows exponentially with the dimension. In this paper we present an improved version of the same method, whose order of memory consumption is a (very low) polynomial in both n and d . We also describe how we parallelized the algorithm and ran it through the Internet on dozens of computers simultaneously.