Faster remainders when the divisor is a constant: beating compilers and libdivide
1 comments · performance
- Comments1
–Rank now
#20Peak rank
1Days on list
–Score · 7d
Oct 31, 2026First seen
On Lobsters
performance
- Score
- 9
- Comments
- 1
- Submitted by
- calvin
- Tags
- performance
- Site
- lemire.me
Story details from Lobsters ↗ · linked article on lemire.me.
Trending history
Faster remainders when the divisor is a constant: beating compilers and libdivide was first seen on Lobsters · Hottest on Oct 31, 2026. Since then it has appeared in 1 check on 1 different day. Its best position was #20 of 25, reached on Oct 31, 01:51 UTC. It dropped off the list after Oct 31, 01:51 UTC.
Rank history
Position on Lobsters · Hottest at every check (lower is better).
Last 14 days
Best rank per day (UTC).
20
Oct 26today
From the discussion
A few top-level comments from Lobsters, shortened. Read the full thread on Lobsters.
Incidentally, this has a connection to [the post here on hashing with multiplies instead of modulo](https://lobste.rs/s/5rque3/fibonacci_hashing_optimization_world). There user 0x2ba22e11 correctly speculated that this trick might be possible and make hashing with an integer modulus more competitive. Lemire could…
Featured in
Archived daily, weekly and monthly lists that include this entry.
Lobsters 1 day, best #20
Questions
Is Faster remainders when the divisor is a constant: beating compilers and libdivide trending on Lobsters right now?
Not at the moment. It was last on the list on Oct 31, 01:51 UTC, after 1 day of trending.
What is the highest rank Faster remainders when the divisor is a constant: beating compilers and libdivide reached?
#20 on Lobsters · Hottest, on Oct 31, 01:51 UTC. Trendoday checks this list every 30 minutes.
How long has Faster remainders when the divisor is a constant: beating compilers and libdivide been trending?
It was first seen on Oct 31, 2026 and has been on the list on 1 day (1 check) since.