Skip to content
Discussion options

You must be logged in to vote

Here is how the three-stage pipeline works, with typical real-world percentages.

Stage 1 — Size grouping (instant)

DupeSweep groups all files by their exact byte size. Any file with a unique size is immediately excluded — it cannot have a duplicate. This is a pure in-memory sort with no I/O.

Typical reduction: 70–90% of files are eliminated here because most files have unique sizes (logs, photos with timestamps, etc.).

Stage 2 — Fast hash (partial read)

For the remaining size-matched groups, DupeSweep reads only the first 16 KB of each file and hashes it. Files where even the first 16 KB differ are split into separate groups and eliminated.

Typical reduction: another 80–90% of the stage-1…

Replies: 1 comment

Comment options

amasen02
Jul 26, 2026
Maintainer Author

You must be logged in to vote
0 replies
Answer selected by amasen02
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
1 participant