Conferences & Workshops Internships

Google Hash code Team Based Programming Competition for University Students and Industry Professionals.

hashcode_hero

Competition overview

Hash Code is a team-based programming competition organized by Google. You pick your team and programming language, we pick a real-life engineering problem to solve. Are you up for the challenge?
For each round of the competition we’ll present a problem (see past problems here) and your team will write a program in order to generate a solution. Your team can submit as many solutions as you’d like to the online Judge System, and a live scoreboard will let you know how you stack up against the competition. Top scoring teams will win cool Google prizes, because of course you can’t host a programming competition without something to work for! Convinced yet? Grab some teammates, get signed up and let the countdown begin.

 Registration
30th November 2015 to 9th February 2016, 18:00 CET

Hash Code is open to university students and industry professionals (18+) in Europe, the Middle East and Africa. Participants register and compete in teams of two to four. Registration is free and will close on 9th February 2016 at 18:00 CET.
Online Qualification Round
Thursday,
11th February 2016
18:30 to 22:30 CET
Our Hangout On Air announcement will start at 18:30 CET. Your team will be tasked with solving a real-life challenge created by Google engineers using your own computer and programming language and tools of your choice.
Final Round
Saturday,
19th March 2016
9:30 to 21:30 CET
Top scoring teams from the Online Qualification Round will be notified on 15th February 2016 and invited to the Final Round at Google Paris. We’ll present a second challenge, and the winning teams will be awarded cool Google prizes. In addition to the competition, participants will also get the chance to learn more about Google through a variety of tech talks and presentations.

What do I need to participate?

The only thing you need for the Online Qualification Round is a computer connected to the Internet. The Hangout on Air will be available on YouTube, so if you can watch YouTube videos on your computer then you should be able to view it. The Judge System will be available as a web application, compatible with recent web browsers. For the rest of your computer setup, you’re free to use the tools and programming languages of your choice.

How will I receive information?

We will add all participants to a mailing list ([email protected]), and will send all relevant information there (so monitor your mailbox!). The problem statement will be available on the Judge System, and we will also post any clarification to the problem statement there. You’ll also be able to get in touch with us over email if you have any questions.

How should I prepare?

You should carefully review the rules of the competition. It may also be helpful to look at problem statements from the past editions of Hash Code. We encourage you to practice together with your teammates, and agree on the programming languages and tools you’d like to use. You should prepare an empty “Hello World!” project on your computer, with a script to generate the ZIP file to upload the source code to the Judge System.

Where is the Google office in Paris?

The Google Paris office is located 8 rue de Londres in Paris. It’s in the city center of Paris near Gare Saint-Lazare and the Opera, in the same district as the famous department stores. It’s easily accessible via many subway stations.

What about travel and accommodation?

Participants will be responsible for arranging their own travel and accommodation. We’ll offer a partial travel reimbursement in order to help offset these costs.

What do I need to bring?

The only thing you absolutely need to bring is your own laptop (with its charger!). You may also bring your own separate keyboard and mouse, but this is not a must. We will offer free Internet connection by Wifi. Please note that wired connection is not available.
visit official website  https://hashcode.withgoogle.com/index.html

.