The paper is concerned with the application of our original variant of the Finite Element Tearing and Interconnecting (FETI) domain decomposition method, called the Total FETI (TFETI), to solve solid mechanics problems exhibiting geometric, material, and contact non-linearities. The TFETI enforces the prescribed displacements by the Lagrange multipliers, so that all the subdomains are 'floating', the kernels of their stiffness matrices are known a priori, and the projector to the natural coarse grid is more effective. The basic theory and relationships of both FETI and TFETI are briefly reviewed and a new version of solution algorithm is presented. It is shown that application of TFETI methodology to the contact problems converts the original problem to the strictly convex quadratic programming problem with bound and equality constraints, so that the effective, in a sense optimal algorithms is to be applied. Numerical experiments show that the method exhibits both numerical and parallel scalabilities.