11 nanoseconds per word: Ridiculously Over-Optimizing Anagrams
0 comments · performance, rust
- Comments3
–Rank now
#6Peak rank
3Days on list
245Score · 7d
Nov 5, 2026First seen
Rank · 7 days
On Lobsters
performancerust
- Score
- 35
- Comments
- 3
- Submitted by
- vi_mi
- Tags
- performance, rust
- Site
- wiredream.com
Story details from Lobsters ↗ · linked article on wiredream.com.
Trending history
11 nanoseconds per word: Ridiculously Over-Optimizing Anagrams was first seen on Lobsters · Hottest on Nov 5, 2026. Since then it has appeared in 72 checks on 3 different days. Its best position was #6 of 25, reached on Nov 5, 13:51 UTC. It dropped off the list after Nov 7, 15:51 UTC. The same link also trended on Hacker News, which raises its cross-platform score.
Rank history
Position on Lobsters · Hottest at every check (lower is better).
Last 14 days
Best rank per day (UTC).
6
10
19
Oct 26today
Metric history
Platform metric as reported by Lobsters.
Where it trended
| List | Best | Days | Checks | Last seen |
|---|---|---|---|---|
| Lobsters · Hottest | #6 | 3 | 72 | |
| YHacker News · Front page 11 Nanoseconds per Word: Over-Optimizing Anagrams | same link | |||
From the discussion
A few top-level comments from Lobsters, shortened. Read the full thread on Lobsters.
this is neat but i'd argue that finding the primes should count towards the time spent per word, otherwise it doesn't matter how you hash things because the list is fixed so you just need to compute it once
People here might also like [mset](https://github.com/backtracking/mset), an OCaml library for representing small multisets in one machine word, and the paper [Les anagrammes de ce titre](https://hal.science/hal-05317860/document) (in French) presenting this library and other tricks to enumerate anagrams of a whole…
This does a similar thing in Nim up to the Gödel Numbering bit: https://forum.nim-lang.org/t/5917#36737 (and beyond -- doing the "fun to throw at a solver" part TFA mentions). After that, the TFA seems to make a (fairly common) mistake of optimizing parsing/building the table. If you're doing many runs against a…
Featured in
Archived daily, weekly and monthly lists that include this entry.
Questions
Is 11 nanoseconds per word: Ridiculously Over-Optimizing Anagrams trending on Lobsters right now?
Not at the moment. It was last on the list on Nov 7, 15:51 UTC, after 3 days of trending.
What is the highest rank 11 nanoseconds per word: Ridiculously Over-Optimizing Anagrams reached?
#6 on Lobsters · Hottest, on Nov 5, 13:51 UTC. Trendoday checks this list every 30 minutes.
How long has 11 nanoseconds per word: Ridiculously Over-Optimizing Anagrams been trending?
It was first seen on Nov 5, 2026 and has been on the list on 3 days (72 checks) since.