fastest-character-counter-in-the-west

The Challange

Count the occurences of the letters A, C, G and T in a string (char array) as quickly as possible. The string consist only of ACGT and is of arbitrary length.

The Code

(Ab)using AVX2 the time can be ~5ms on a i7 or Zen.

Repository Structure

• psygate -> my solutions
• KillerLink -> https://github.com/KillerLink solutions