FizzBuzz: Least unique bytes Introduction:

Although it seems challenges scored by least unique characters have been attempted, there are few which were well-received. I think it's a potentially interesting scoring criterion, as long as different languages aren't competing with each other (as with code golf).

Challenge:

Create a basic FizzBuzz program or function. The output should be the decimal numbers 1 to 100, inclusive. For multiples of three, print Fizz instead of the number, and for the multiples of five print Buzz. For numbers which are multiples of both three and five, print FizzBuzz.

A trailing newline is allowed, and \n or \r\n can be used to separate the numbers (and Fizzes and Buzzes and FizzBuzzes).

Scoring:

The answer (per language) with the least unique bytes wins. For example,

abbcccdeee


would have a score of 5, as it contains are 5 distinct bytes.
Unary, score 1 (\$3.065... × 10^{185}\$ bytes)
I couldn't resist ;)
The program consists of 306542480187333548229216501998737670100823810347304444087725506753387994506955599380251625023427643514071322084229755566193943772995081070792874713832316221905650936799216302699728340431 times a single character of your own choosing, which translates to the following brainfuck program:
++&gt;+++++&gt;&gt;&gt;&gt;&gt;++++++++++[&gt;+&gt;&gt;+&gt;&gt;+&gt;+&lt;&lt;&lt;[++++&lt;-&lt;]&lt;,&lt;,-&lt;-&lt;++&lt;++++[&lt;++&gt;++++++&gt;]++&gt;&gt;]&gt;[+[[&lt;&lt;]&lt;[&gt;&gt;]+++&lt;[&lt;.&lt;.&lt;..[&gt;]]&lt;&lt;-[&gt;&gt;&gt;[,&gt;&gt;[&lt;]&gt;[--.++&lt;&lt;]&gt;]]+++++&lt;[+[-----.++++&lt;&lt;]&gt;&gt;+..&lt;-[&gt;]]&lt;[-&gt;&gt;,&gt;+&gt;&gt;&gt;-&gt;-&gt;.&gt;]&lt;&lt;]&lt;[&gt;+&lt;&lt;&lt;,&lt;-&gt;&gt;&gt;+]&lt;]

Port of @MitchSchwartz' brainfuck answer for the 1,2,Fizz,4,Buzz challenge, so make sure to upvote him!
Try it online as brainfuck.
The byte-count is generated with this 05AB1E program I wrote.