Simple maths problem

This is to test my theory before I create a program. I wanted to create a program where i have 256 positions or circuit's on x axis (vertical) and 32 circuits on y axis (horizontal) so we have 256 x 32 circuits. The goal is to get as many unique 32 digit combinations as possible along y axis (horizontal) as their is 1 circuit activated at a time on x axis (verticle) and the activated circuit will travel up and down to top to bottom up and down constantly. I will need each cycle of each activated circuit to go at different speeds/rates in order to get a unique 32 digit outcome each time as if they all going up and down at the same speed they would be the same combination each time. I need to know of it can work and what the maths would look like to ensure it works and work in a way to discount multiple duplicates. I also need to know how many combinations of 32 numbers we can get per N amount of time