In this paper the efficient space virtualisation for the Hoshen-Kopelman algorithm is presented. We observe minimal parallel overhead during computations, due to negligible communication costs. The proposed algorithm is applied for computation of random-site percolation thresholds for four dimensional simple cubic lattice with sites' neighbourhoods containing next-next-nearest neighbours (3NN). The obtained percolation thresholds are pC (NN) = 0.19680(23), pC (2NN) = 0.08410(23), pC (3NN) = 0.04540(23), pC (2NN+NN) = 0.06180(23), pC (3NN+NN) = 0.04000(23), pC (3NN+2NN) = 0.03310(23), pC (3NN+2NN+NN) = 0.03190(23), where 2NN and NN stand for next-nearest neighbours and nearest neighbours, respectively. 11 87 s t r _ b u f f e r = " " 88 c a l l get_command_argument ( 1 , s t r _ b u f f e r ) 89 read ( s t r _ b u f f e r , fmt=" ( I ) " ) L 90 s t r _ b u f f e r = " " 91 c a l l get_command_argument ( 2 , s t r _ b u f f e r ) 92 read ( s t r _ b u f f e r , fmt=" (F) " ) p_min 93 s t r _ b u f f e r = " " 94 c a l l get_command_argument ( 3 , s t r _ b u f f e r ) 95 read ( s t r _ b u f f e r , fmt=" (F) " ) p_max 96 s t r _ b u f f e r = " " 97 c a l l get_command_argument ( 4 , s t r _ b u f f e r ) 98 read ( s t r _ b u f f e r , fmt=" (F) " ) p_step 99 s t r _ b u f f e r = " " 100 c a l l get_command_argument ( 5 , s t r _ b u f f e r ) 101 read ( s t r _ b u f f e r , fmt=" ( I ) " ) N_run