In this paper we present the SteinLib, a library of data sets for the Steiner tree problem in graphs. This library extends former libraries on Steiner tree problems by many new interesting and difficult instances, most of them arising from real-world applications. We give a survey on the difficulty of these problem instances by stating references to state-of-the-art software packages that were the first or are currently among the best to solve these instances.