An unknown number T of random data vectors have been stored in a sparse distributed memory with randomly chosen hard locations. A method is given to estimate T. The estimate is unbiased, and the coefficient of variation is roughly inversely proportional to the square root of MU, where M is the number of hard locations in the memory and U the length of data.