ChoiceHat
Set the smallest and largest value, how many numbers you need, and whether repeats are allowed. Bounds and count are checked before anything is drawn.
Numbers will appear here.
Each integer comes from crypto.getRandomValues with rejection sampling, so there is no modulo bias. When repeats are off, a sparse Fisher-Yates sample guarantees distinct values without building the whole range.
Yes. Use negative values for the minimum and/or the maximum.
Bounds are limited to ±1,000,000,000 and the count to 10,000. The page never allocates memory proportional to the range, so a huge range with a small count stays fast.
If No repeats is on and you ask for more numbers than the range holds, that request is impossible — the form says so instead of silently reducing the count.