Random Name Picker
Draw winners and reserves from a list without repeats, split it into teams or put it in a random order.
10 names. Separate with new lines, commas or semicolons.
This tool is for information and fun and is not legal advice. Official draws such as prize promotions may have their own legal rules; check the regulations that apply before running one.
What does the random name picker do?
Paste your list, enter how many winners and reserves you need, and draw. Each name can come out only once; winners and reserves are chosen in the same draw, in order. You can also split the same list into teams or simply shuffle it to get a random order, such as a presentation order. Everything runs in your browser and the list is never sent to a server.
How is the draw kept fair?
Random numbers come from the browser's Web Crypto API, crypto.getRandomValues(), not from Math.random(). MDN notes that Math.random() is not cryptographically secure and recommends getRandomValues() instead. Each pick uses a 32-bit number between 0 and 4,294,967,295.
Reducing that number to the size of your list with a plain remainder (x mod n) adds a small bias, because 2³² usually does not divide evenly by n. The tool avoids this with rejection sampling: values above the largest multiple of n that fits in 2³² are discarded and a new number is drawn. Ordering uses the Fisher–Yates (Durstenfeld) shuffle, which makes every possible order equally likely when the random source is unbiased.
limit = ⌊2³² ÷ n⌋ × nif x < limit then index = x mod n, otherwise draw againP(a given person wins) = k ÷ nPossible winner groups = C(n, k) = n! ÷ (k! × (n − k)!)Worked example: for a list of 10 names the limit is 4,294,967,290. Only the top 6 of the 2³² values are discarded, so a number has to be redrawn only about once in 716 million tries. If you draw 2 winners and 1 reserve, each name has a 20% chance of winning, a 10% chance of being the reserve, and there are 45 possible winning pairs. For comparison, picking the same 10 names from a single byte (0–255) with a plain remainder would give 6 names a 26/256 chance and the rest 25/256, an unfair 4% advantage for the first group.
Chance of winning by number of entrants
Each person's chance grows in line with the number of winners. The table shows one entrant's chance in a single-winner and a three-winner draw, plus how many different groups of three could come out.
| Entrants | 1 winner | 3 winners | Possible groups of 3 |
|---|---|---|---|
| 10 | 10% | 30% | 120 |
| 20 | 5% | 15% | 1,140 |
| 50 | 2% | 6% | 19,600 |
| 100 | 1% | 3% | 161,700 |
| 500 | 0.2% | 0.6% | 20,708,500 |
Splitting into teams and shuffling a list
In team mode the list is shuffled with Fisher–Yates and then dealt into teams in order. Team sizes differ by at most one person: 11 people in 3 teams gives sizes of 4, 4, 3. Shuffle mode puts the whole list in a random order, which is handy for presentation, rota or turn order.
With Remove duplicate names switched on, upper and lower case are ignored when comparing names, including the Turkish dotted and dotless i (ALI, Ali and ALİ count as one name). If you deliberately want to give someone two entries, switch the option off and write the name twice; their chance doubles, but the same person can then appear twice among the winners.
Frequently Asked Questions
Related Calculators
Random Number Generator
Generate random numbers for draws and games
Calculate →Coin Flip
Digital coin toss for two options
Calculate →Password Combination Calculator
Password combinations and brute-force resistance
Calculate →Percentage Calculator
Percentage increase, decrease, ratio and discount
Calculate →