Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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.

[1] https://www.youtube.com/watch?v=aWbGPMxs0AM



> … he shoved everything into …

Did he do the same in C?


No, he had intrusive pointers; his rectangle nodes were in a couple of doubly-linked lists and an AVL tree at the same time.


So could we paraphrase as — maybe his "naive C" would be faster than his "carefully implemented C" ?

He just wasn't comparing apples with apples?




Consider applying for YC's Winter 2027 batch! Applications are open till November 2.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: