Return to Answer

So, I have another suggestion, to work on top of the suggestions by Heslatcher:

So, I have another suggestion, to work on top of the suggestions by Heslacher:

Can it really be faster, with all those casts, shifting (<<) and or's (|)?

Can it really be faster, with all those casts, shifting (<<) and or's (|), and the fact that Microsoft themselves wrote the BitConverter?

Can it really be faster, with all those casts?

Twice the time the non-loop method took.

Can it really be faster, with all those casts, shifting (<<) and or's (|)?

Twice the time the non-loop method took. With a dynamic List you can expect that it will be even slower. (Haven't done any experiments with that method, but one can estimate it would take longer.)