A Rust developer optimized an anagram-finding solver down to 11 nanoseconds per word by discovering a prime-product hashing technique that fits a collision-free identifier into a single 64-bit integer. The article walks through baseline approaches like sorted-string keys and letter-count vectors before presenting the optimized solution for dictionary-wide anagram lookup.
Background
The author is a systems researcher and programmer who writes about self-hosting and low-level programming projects on their Wiredream blog. This post is part of a series tackling word ladder game solving with performance optimization as a central theme.
- Source
- Lobsters
- Published
- Nov 5, 2026 at 03:37 PM
- Score
- 5.0 / 10