The recently proposed O(n log n) integer multiplication algorithm [pdf]
0 comments
–Rank now
#7Peak rank
1Days on list
–Score · 7d
Oct 22, 2026First seen
Trending history
The recently proposed O(n log n) integer multiplication algorithm [pdf] was first seen on Hacker News · Front page on Oct 22, 2026. Since then it has appeared in 68 checks on 1 different day. Its best position was #7 of 30, reached on Oct 22, 18:25 UTC. It dropped off the list after Oct 22, 19:40 UTC.
This page has little history so far; it stays out of search results until the item has trended on two days or has more context.
Rank history
Position on Hacker News · Front page at every check (lower is better).
Last 14 days
Best rank per day (UTC).
Oct 26today
Metric history
Platform metric as reported by Hacker News.
Featured in
Archived daily, weekly and monthly lists that include this entry.
Hacker News 1 day, best #7
Questions
Is The recently proposed O(n log n) integer multiplication algorithm [pdf] trending on Hacker News right now?
Not at the moment. It was last on the list on Oct 22, 19:40 UTC, after 1 day of trending.
What is the highest rank The recently proposed O(n log n) integer multiplication algorithm [pdf] reached?
#7 on Hacker News · Front page, on Oct 22, 18:25 UTC. Trendoday checks this list every 15 minutes.
How long has The recently proposed O(n log n) integer multiplication algorithm [pdf] been trending?
It was first seen on Oct 22, 2026 and has been on the list on 1 day (68 checks) since.