I looked into his python implementation, I thought he would just translate the parameters and call find, but he instead did go to implement the search algorithm.
Wouldn't that make it a bit slower than the original find?
File system traversal can be quite slow on traditional hard disk drive, it requires a lot of random disk access which has much higher latency than sequential access (think about the moving parts in the disk drive). So I guess that being written in Python is hardly the bottleneck if the disk reads have not been cached by the kernel.