Browse Source

updated link

main
Inga 🏳‍🌈 3 months ago
parent
commit
5cc8e5312c
  1. 2
      README.md

2
README.md

@ -6,7 +6,7 @@ where you had to, given the dictionary, and given three MD5 hashes, @@ -6,7 +6,7 @@ where you had to, given the dictionary, and given three MD5 hashes,
find three-word anagrams of a phrase *"poultry outwits ants"*
which result in these hashes.
My [original solution](https://github.com/inga-lovinde/TrustPilotChallenge)
My [original solution](https://oomza.cutegay.software/inga-lovinde/TrustPilotChallenge)
was in mixture of C# and plain C (with a bit of Visual C++
as a bridge), and heavily used AVX2 intrinsics for optimization.

Loading…
Cancel
Save