"MOEX Code." Hackathon

    How to choose the best students to work in an IT company?


    We take 300 applicants from the best universities in the capital, add several selection stages, 1 preliminary technical task and decorate with “cherry” in the form of the final “Hackathon”!

    In our blog on Habré, we already wrote about the launch of a new internship program for students of IT specialties at the Exchange. In February, the project started successfully, and we received more than 300 applications from students at the Higher School of Economics, Baumanki, Moscow State University, Moscow Institute of Physics and Technology and other metropolitan universities. Of these, only 31 applicants ended up in the finals and participated in the struggle for the right to become a “stock market IT specialist” for a year.

    HOW IT WAS
    At the preliminary stage of selection, participants were asked to write a discrete auction model (along the way, we replenish the dictionary: “discrete auction” is a mechanism that replaces the suspension of trading and is used in case of significant movement of securities prices. Now the discrete auction mode is introduced by the Moscow Exchange in the stock market if the paper rises or falls by 20% within ten minutes. During the auction, which usually lasts no more than 30 minutes, the collection of applications for the conclusion of transactions takes place, after which a single price is determined at which they pass ).
    31 participants became the best in this task. They met in the final of the competition, which took place in the “hackathon” format directly in the Exchange office.

    image

    And, yes, it didn’t seem to you - the famous game “2048”, created by the Italian developer Gabriele Cirulli, is really open in the photographs of students!

    Already there were a lot of publications on the subject of writing the algorithm for the game “2048”, and the more interesting it was to look at the solution options from our potential interns.

    Briefly about the technical part of the hackathon task


    image

    The guys were given more than an hour to complete, many teams managed much faster - 10-15 minutes and you're done! But each team sent more and more optimized versions of the code to gain extra points.
    By the way, the teams were formed in random order, most of the students met and worked together already in the hackathon process, which became an additional challenge.

    According to the results of the hackathon, the best team was Marat (4th year of the HSE course) and Alexander (5th year of the Baumanka course). In the process of writing the code, their bot passed the mark of 10.000+ points, and then 12.000 points, which went into the overall standings. But in the process of testing and optimizing the code, the guys had a result of more than 13,000. We apply the version of the algorithm that won the hackathon www.dropbox.com/sh/5p1ikuosqetzpu2/AADpPOTYqeck7hlTYZ-Jn0yFa?dl=0. The participants themselves admit that the result is not perfect and could be much better if there was more time to optimize the algorithm.

    The hackathon jury was 100% composed of our colleagues from the IT department:
    - Head of the data distribution systems group;
    - Senior programmer of integration services development;
    - Head of tool support;
    - Head of integration with risk systems.
    In addition to their judicial function, colleagues, after announcing the results, willingly communicated with the hackathon participants. The guys were actively interested in their work, IT experience, asked questions about the competition and just asked for advice.

    RESULTS


    In the final, 3 teams that wrote the most optimal algorithms won. Who will become an exchange trainee? This will be decided by an experienced jury - an interview awaits the guys, and very soon the best of the best will join the team of “harsh exchange IT specialists”!

    A small photo report from the scene:

    image
    image
    image
    image
    image
    image
    image

    We tried the hackathon format for the first time, and we admit that we are very pleased. We hope the participants too!

    Also popular now: