From a glance, they replaced linked lists with vectors, changed dominator tree building to semi-NCA, and used sparse bitsets to reduce memory usage.
Very niche but effective. When people ask why do FAANGs focus on data structure algos during interviews, it's for cases like this. With that said, I understand candidates frustration since most end up working on higher level network services.