3 ms·Any implementation of an algorithm is slow when your baseline is not performing the computation at all.by formerly_proven 2y agoAny implementation of an algorithm is slow when your baseline is not performing the computation at all.iscoelho 2y agoHaha, it's zero-copy! I never said it was "faster-copy" (-:hinkley 2y agoThe fastest line of code is no line at all.‡ [‡]: Unless it's some weird architectural fluke with pipelining.