Hacker News Reader

Looks like the impl uses a HashMap. I'd be curious about how a trie or some other specialized string data structure would compare here.

I think this could potentially really reduce the amount of memory required - especially in cases where there is a lot of repetitive prefixes.

Would be interesting to try this out