A hash algorithm's security isn't measured so much in how fast you can bruteforce it (that's more of a side effect), but rather flaws in the actual digest: collisions (primarily), preimage attacks and length extensions (in the event that the hash is based on a Merkle-Damgard construction, most are).
All of these flaws then contribute to how easily and quickly it can be bruteforced, as they show poor entropy.