Feature: Sparse Matrix Multiplications

### Describe what you are looking for

In numpy/scipy, `A @ B` is much faster if `A` is sparse and turned into scipy sparse matrix. If both are sparse or only matrix `A` is sparse and `B` is dense. Both works.

Can SimSIMD improve such matrix multiplications.

### Can you contribute to the implementation?

- [ ] I can contribute

### Is your feature request specific to a certain interface?

It applies to everything

### Contact Details

_No response_

### Is there an existing issue for this?

- [X] I have searched the existing issues

### Code of Conduct

- [X] I agree to follow this project's Code of Conduct