Beliakova gave in [2] a method for computing link Floer homology. We extend her approach to $\mathbb Z$ coefficients and implement it in a publicly available computer program. We review the main programming and optimization methods used. Our program is then used to check that the Floer homology of a prime non-alternating knot with $\leqslant 11$ crossings has no torsion.