## Challenge
Write as many functions, programs, or snippets of code, that result in 256. Your score is the number of separate solutions submitted in an answer.
The challenge? The characters used in one solution must not appear in any other solution. That is, there is no character used in more than one program.
## Notes
- The bytes of the solution, in the encoding used by the interpreter/compiler running the solution, are what is used for distinctness checking. For example, if the answer is scored in UTF-8, one solution containing `á` means no other can contain `é` as both share the `0xC3` byte, but an SBCS containing both would allow it.
- Solutions must have at least one character (otherwise the empty program giving 256 would result in a score of $\infty$).
- The usage of bytes for scoring means that the maximum score ever achievable is 256 (but getting that would mean having a language where every character prints 256).
- The result can be either a number, that equals to 256 (or differs from it by a maximum of 0.001), or a string representing it in decimal form, possibly ending with `.0`.
- Each submission can be of a different type (function, program, snippet), and can return in a different format (return value, STDOUT, console, etc.)
- Yes, snippets of code are allowed. So `256` is a valid solution in most languages.
- Highest score wins!
