diff --git a/src/bqn/rollim.bqn b/src/bqn/rollim.bqn
index 510cc6c..fc60205 100644
--- a/src/bqn/rollim.bqn
+++ b/src/bqn/rollim.bqn
@@ -56,3 +56,5 @@ BM 6‿1‿3‿1‿3‿3‿4‿3‿3‿5
 HL ← (+´∘«⊒˜≤+`⌾⌽)·/⁼≠⊸⌊
 HS ← +´∨≥1+⊒˜
 (HL≡HS)◶@‿HL 14‿14‿11‿9‿5‿5‿1‿1‿1‿1‿0
+
+HL‿HS {𝕎•_timed𝕩}¨< 1e8 •rand.Range 1e3
diff --git a/src/rollim.org b/src/rollim.org
index ded9792..078ac75 100644
--- a/src/rollim.org
+++ b/src/rollim.org
@@ -260,6 +260,15 @@ implement this useless thing:
 #+RESULTS:
 : 5
 
+If someone ever published that much, sorting will eventually be slower:
+
+#+begin_src bqn :tangle ./bqn/rollim.bqn :exports both
+  HL‿HS {𝕎•_timed𝕩}¨< 1e8 •rand.Range 1e3
+#+end_src
+
+#+RESULTS:
+: ⟨ 0.083824959 0.21801262700000001 ⟩
+
 A testament to the idea that the simplest solution in BQN is often the most efficient:
 I initially clip my citations array with ={≠¨⊔≠∘𝕩¨⌾(≥⟜≠∘𝕩⊸/)𝕩}=, which is just =/⁼≠⊸⌊=.