  We provide explicit expressions for quadrature rules on the space of $C^1$
quintic splines with uniform knot sequences over finite domains. The quadrature
nodes and weights are derived via an explicit recursion that avoids an
intervention of any numerical solver and the rule is optimal, that is, it
requires the minimal number of nodes. For each of $n$ subintervals,
generically, only two nodes are required which reduces the evaluation cost by
$2/3$ when compared to the classical Gaussian quadrature for polynomials.
Numerical experiments show fast convergence, as $n$ grows, to the "two-third"
quadrature rule of Hughes et al. for infinite domains.
