The naïve Rust part is explained in a video [1] that Bryan released a couple of weeks ago; instead of using bespoke data structures for his problem, he shoved everything into HashMaps and BTreeSets and used numerical indices rather than pointers to "emulate" a doubly-linked list. It turned out that was good enough to beat C.
