  In $r$-neighbour bootstrap percolation, vertices (sites) of a graph $G$ are
infected, round-by-round, if they have $r$ neighbours already infected. Once
infected, they remain infected. An initial set of infected sites is said to
percolate if every site is eventually infected. We determine the maximal
percolation time for $r$-neighbour bootstrap percolation on the hypercube for
all $r \geq 3$ as the dimension $d$ goes to infinity up to a logarithmic
factor. Surprisingly, it turns out to be $\frac{2^d}{d}$, which is in great
contrast with the value for $r=2$, which is quadratic in $d$, as established by
Przykucki. Furthermore, we discover a link between this problem and a
generalisation of the well-known Snake-in-the-Box problem.
