In this study, we focus on the random insertion approach and evaluate its efficiency in constructing solvated systems. We compare the naive O(N 2 ) implementation with the optimized k-d tree O(N log N ) method. We demonstrate that the k-d tree optimization can make random insertion a viable alternative to both Packmol and pre-equilibrated box replication, especially for uncommon solvents or custom mixtures.