Counting the number of matching characters in two ASCII strings | Lobsters

3

Counting the number of matching characters in two ASCII strings performance lemire.me
via calvin 1 year ago | archive
Archive.org Archive.today Ghostarchive
| 1 comment

1

1

Nesh 1 year ago | link

Definitely in the real of super high efficiency because that code is extremely unreadable.

For fun, I would have XOR’d the two byte representations and just summed the 1’s to get the total.