.net - Fastest Hash Algorithm for Text Data

Question

I'm trying to choose a hash algorithm for comparing about max 20 different text data.

Which hash is better for these requirements?

• Less CPU Consumption
• Small footprint (<=32 bytes)
• Collision is not a big deal
• Can be generated from .NET Framework 2 (shouldn't be a 3rd party library)

I'm using hash for less memory footprint and comparison performance

Answer 1

If collision is not a big deal you can take the first letter of each document. Or you can use the length of the text or the string with the text.