Bruteforce tool / cracker for MD5 hashes. Processing single hashes, lists and combolists (userid:md5hash).
-
Updated
Apr 4, 2021 - Python
Bruteforce tool / cracker for MD5 hashes. Processing single hashes, lists and combolists (userid:md5hash).
Google # Hash Code 2018 Challenge
Google Hash Code solutions.
Solution for Google Hash Code 2018 Qualification Round
Our solution for the 2020 hashcode qualification round problem with libraries and books
Code written during partecipations at contests like HashCode, Kickstart and CodeJam or CTF challenges like CaptureTheFlag organized by Google.
Our solutions for Google Hashcode 2021 Traffic Signalling
My team's Hash Code 2020 solutions
Hash Code 2019 Online Qualification Round solution (score: 800521, rank: 582 of 6671)
Google hashcode 2020 submission (solution)
Google Hash Code 2021 qualification round: Traffic Signalling. Score: 10,739,965 (#1 in the extended round).
Google Hash Code 2018 - Final Round - 35th place (Extended Final Round - 12th place)
HashCode 2021 practice question solution with 727,667,236 points. It is a clean and readable 4 hours solution written in Python.
Hash Code 2019 qualifier (scores about 1.18-19M)
Google HashCode 2018 qualification round solution. Score: 49,968,454
Team Anguan. Our decision for the qualifying round.
Our solution for the 2022 qualification round - Positioned 99th scoring 3360259 points (with a peak of 26th ranking 1h before the end 🙀)
Google hashcode 2019 submission
HashCode 2020 Qualification: Book scanning. Solution score: 26,920,732
Add a description, image, and links to the hashcodesolved topic page so that developers can more easily learn about it.
To associate your repository with the hashcodesolved topic, visit your repo's landing page and select "manage topics."