Galois subhierarchy (GSH) is a polynomial-size representation of a concept lattice which has been applied in several research domains, such as software engineering and linguistics. Ares, Ceres and Pluton are three algorithms that build GSH following different construction strategies. In this paper, we analyze the performance of these algorithms in terms of their computation time, using Java and C++ (as implementation languages) and Galicia (as our development platform). We show how the API of C++ has mostly a meaningful positive influence in the results, and how Pluton is the most suitable algorithm to compute a GSH in most of the cases.