Random picker: draw a winner from your list

A winner from your list, with or without repeats.

One per line or separated by commas. Numbering like “1.” is ignored.

Rules

How to run a draw

Paste the participants — one per line or comma-separated. Numbering such as "1." and "2)" is stripped, so a list from a messenger can be copied as is. Specify how many winners you need, and enable "no repeats" if one person should not win twice.

If there are more participants than fit on screen, that is fine: the limit is 100 winners per draw, while the list can be any length. A social media giveaway needs no API access: copy the handles from the comments, paste them line by line and pick a winner.

Why this is fair

The list is shuffled with the Fisher–Yates algorithm, and the indices come from a cryptographic generator. This guarantees that every name has an equal chance of ending up first — unlike "shuffling in your head" or "picking the first thing that catches your eye". The result is visible immediately and can be copied to keep a record.

If you need verifiable draws

For public prizes people sometimes ask for proof that the choice was not rigged. Transparency helps here: the whole list is visible before the button is pressed, and the algorithm is deterministic given a known sequence of random numbers. For the most formal cases, public services with a record and a hash are used — that is already beyond the scope of a browser tool.

Identical lines count as different participants. If the list contains two people named "Ivan", the generator may pick either of them — check the list before the draw.

Frequently asked questions

How should I format the list?

One option per line, or separated by commas. Numbering such as "1." and "2)" is stripped, so you can paste a list straight from a messenger.

How do I pick several winners without repeats?

Turn on "no repeats" and set the number. The same entrant cannot win twice, and the number cannot exceed the number of options.

Is the draw fair?

Yes: the list is shuffled with the Fisher–Yates algorithm on a cryptographic generator. Every name has an equal chance of landing in first place.

Checked: 26 October 2026. For reference only — the result depends on the material and the skill of the installer.