Is triple-CRC-32 a bad (or not) idea for generating a uniform distribution hash? I have an input of 288 bits (comprising 4 × 32-bit and 10 × 16-bit integers). I need to hash this to 96 bits with as few collisions as possible.

I'm aware that CRC is a bijective hash, thus ensuring 100% even distribution (as I understand it). In my view, I should be able to run 3 parallel CRC paths through the input, resulting in a 96-bit hash of optimum distribution.

However, I'm also aware that CRC is not used for such applications. An algorithm such as MetroHash would typically be used.

Could someone explain to me why CRC is a bad (or not) idea for this application?

Note: This is not intended for anything secure.
The identity function is also a bijection. That doesn't make it a good hash in any way.
If a function reduces input size, how can it be a bijection?
If you are not intending anything secure maybe this is the wrong place to ask. ;)
Maybe a more useful answer is this.