As a matter of fact, this particular case just barely (by one[!] move, but still) does run into the 50-move rule. There are neither pawn moves nor any captures made in moves 6 through 55, which means that right after move 55 the 50-move rule would normally have kicked in.
Here the whole sequence (notice moves 5, 55, and 56):
Forced wins provided by Nalimov or Gaviota tablebases are not constrained by limits such as the 50-move rule (although one could create tablebases by means of a modified algorithm that would conform to that, or similar, rule).
Thanks to 6-man tablebases, the following position has been made known to be a win for White in no less (with optimal defense on the part of Black) and no more (with optimal play on White's part) than 262 moves:
I don't have 6-man tablebases available locally and haven't looked through the winning sequence, thus I can't tell at the moment whether the 50-move rule might prevent an actual win from happening in this particular case.
However, firstly, the 50-move rule does not adjudicate (at least it should not - the implementation on various chess servers may vary though) a game by itself - a draw, similarly to occurences of threefold repetition, needs to be claimed by one of the participants if it is observed that the conditions for an application of the rule have been met.
Secondly, such ridiculously long winning sequences are more of a theoretical significance, and most likely would never have been found/proven without the assistance of tablebases in the first place, thus constraints geared towards practical play, such as a move limit rule, may be as well be abstracted from when contemplating such winning lines.
no, pawn moves.