A Sneak Peek at Tuenti Challenge 9
7 Days
174,818 Lines of code
2,675 Attempts to solve a problem
2,328 Problems solved correctly
1,204 Registered participants
524 Participants solving at least one problem
The 9th edition of the Tuenti Challenge has ended last Monday and, as usual, we bring you some quick stats about the challenges! This year we return to the original amount of 20 problems (up from 15 in the two previous ones), so we included more easy problems to make up for it (and this has led to an increase in the amount of solutions). We hope our participants had more fun solving all of them!
This year we had 1204 registrations, from which 524 solved the first problem and 3 of them completed the last one! You can check them at the full ranking.
Now, let’s take a look at the per-problem stats. As expected, the first stopper (problem with less solutions than the next one) was the first non-algorithmic one, challenge 8! In this problem you had to hack into a website by first obtaining the source from the alternate port, and then find two security bugs in its code. Challenges 10, 14 and 17 were also stoppers (and non-algorithmic too)! We will talk more about these and other problems in our future posts about the competition!
From the languages perspective, Python keeps increasing his reign by being the chosen language for almost half of the solutions! On the other side, the least popular ones were F# and Nim, each of them used by one participant in the first two challenges.
The Tuenti Challenge is a competition which lets people interested in technology show their technical skills while having a good time solving challenges. It also serves to give Tuenti, a company with deep roots in technology, visibility and an opportunity to find highly qualified individuals for its team. The problems are a combination of programming, security and ingenuity challenges.
For those who want to try the challenges or complete any unfinished ones, the webpage and validators will be available until next year. We would also like to congratulate the top 30 contenders and thank everyone for participating!
