Random List Shuffler
Paste a list (one entry per line) and get it back in a random order — handy for a drawing of lots, a speaking order, or fairly distributing tasks.
How it works
The tool applies a Fisher-Yates shuffle algorithm, which guarantees that every possible permutation of the list has an equal probability of being obtained. Empty lines are ignored and each line is stripped of extra whitespace before shuffling. Useful for assigning a speaking order out loud, randomly splitting players into teams, or randomizing the order of quiz questions.
Is the shuffle really fair, without bias?
Yes, the Fisher-Yates algorithm is known to produce a uniform distribution across all possible permutations, unlike naive random-sort methods which can introduce bias.
What happens if my list contains empty lines or duplicates?
Empty lines are automatically removed before shuffling; duplicates, however, are kept as-is and treated as distinct entries in the draw.
100% local processing: shuffling happens entirely in your browser via WebAssembly, your list never leaves your device.