SMRTR ProgrammingSep 10, 2026lobste.rs

Python sets and dictionaries can have quadratic-time performance

SMRTR summary

Hash collisions can degrade Python's dict/set from O(1) to quadratic time, and cache pressure alone can cause 10x lookup slowdowns at scale. A benchmark against fastconstmap reveals the real performance cost.

SMRTR provides this summary for quick context. The original article belongs to lobste.rs.

Read the original article
SMRTR Programming

Get the next batch of curated stories in your inbox.

This archive is built from SMRTR newsletter stories. Subscribe for hand-picked stories without the extra noise.

Related Stories

Browse Programming
ProgrammingSep 10, 2026

My HTML Boilerplate

A detailed breakdown of modern HTML boilerplate, covering every tag's purpose — from charset and viewport to Open Graph, PWA manifests, and favicon strategy.