Summary of the Monte Carlo algorithm presented in this paper. We group individual identical particles. Sticking: when group {i} collides with group {j}, as N_i < N_j, every particle in group {i} sticks to one particle that belongs to group {j}. Merging: if group {j} contains negligible mass, it merges with group {w}, with j and w being particles with similar characteristics. Filling: when group {j} is emptied, it is filled with half of the particles from the largest group {w}. Collision grouping: if group {i} collides with {j}, with particle j being very small compared to particle i, we group collisional events, meaning that in a single collision we stick several j particles into a single particle i.