A central problem of algebraic topology is to understand the homotopy groups of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with trivial), compute the higher homotopy group for any given . However, these algorithms come with a caveat: They compute the isomorphism type of , as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes and represents its elements as simplicial maps from a suitable triangulation of the d-sphere to X. For fixed d, the algorithm runs in time exponential in , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of , the size of the triangulation of on which the map is defined, is exponential in .