Skip to content

Latest commit

 

History

History

Online Qualification Round

Google #Hash Code 2017 Online Qualification Round

Solutions and code for the Google #Hash Code 2017 Challenge "Optimize Cache Servers for YouTube" of our Team Gyrating Flibbittygibbitts.

The problem statement can be found here.

The input files can be found in input/

Have you ever wondered what happens behind the scenes when you watch a YouTube video? As more and more people watch online videos (and as the size of these videos increases), it is critical that video-serving infrastructure is optimized to handle requests reliably and quickly. This typically involves putting in place cache servers, which store copies of popular videos. When a user request for a particular video arrives, it can be handled by a cache server close to the user, rather than by a remote data center thousands of kilometers away. Given a description of cache servers, network endpoints and videos, along with predicted requests for individual videos, decide which videos to put in which cache server in order to minimize the average waiting time for all requests.

from Problem statement for Online Qualification Round, Google #Hash Code 2017

Algorithm

tba.

Scores

Overall 2565511 points.

Highest score during the Online Qualification Round was 2651999 (Team Ababahalamaha), and 2653781 (Team Master Exploder) in the Extended Round.

Me at the zoo

498287 points, processed in 0.01 seconds.

Highest score seen is 516557 *

Me at the zoo

Videos worth spreading

549640 points, processed in 4.35 seconds.

Highest score seen is 610759 *

Videos worth spreading

Trending today

499966 points, processed in 22.12 seconds.

Highest score seen is 499991 *

Trending today

Kittens

1017618 points, processed in 19893.92 seconds

Highest score seen is 1024846 *

Kittens

Authors

Sebastian Brodehl / @sbrodehl

Alexej Disterhoft / @nobbs

Dennis Meyer / @snakebite1457