Let's play a game!

The first person to figure out the password to this account before April 7th will get two sets of devRant stickers for free!

When you've got the password, log in to this account and @mention yourself to prove that you solved it!

Here are your clues:
7 4 12 e 8 18 5

7d 76 64 7a 42 5a 36 7d 3d 4b 36 7f 5b 40 3f 47 44 3d 6d 54 46 6a 61 4b 42 79 53 36 5e 75 5f 38 5c 4a 3d 60 42 55 6d 72 76 36 54 4a 2a

📌

📍

📌

📌

:pin-emote:

Yeah, no, I'm completely stumped :/

🕹️ game on!

📌

📌

📌

Rest in pepperoni. Maybe you should provide some hints and extend the deadline?

I'm sorry you haven't heard from me in a while. looks like nobody figured it out. I'm guessing that some stickers weren't enough to motivate people to try. So I'm going to post a new puzzle. This time, I will buy a devduck for whoever gets it right!

Im guessing you're wondering about the solution to this one. Well, here it is:

I gave you two sequences of hexadecimal numbers. You had to xor them to get a new sequence of numbers. You probably noticed however, that the first sequence was shorter than the second, which means that it would be impossible to xor them. Well, simply loop the shorter sequence then.

For example, an algorithm for solving it could look like this:

for(int i = 0; i < seq2.length; i++) {

pass.push(seq1[i] ^ seq2[i % seq2.length]);

}

With the resulting sequence, all you had to do was convert it to an ascii string and you would have the password. I've changed it now though.