|08 July, 2019||The code for the finalists has been uploaded and can be accessed at the following link: Finalists.|
|06 April, 2019||We've uploaded the large dataset. Additionally, we've finalized details on the travel grant for winners.|
|29 March, 2019||Due to a change in evaluation machine by requirements from our hosting provider, we have reset the leaderboard. Please resubmit your submissions to rank again.|
|22 March, 2019||We've removed explicitly testing radix partitioning from the contest specification, see the task page for further details. Dashboard submissions are now functional, and the leaderboard is as well. Thank you for your patience. We will release the large dataset in a few days.|
|19 March, 2019||Submission expectations are finalized and the quick start package is up. Please bear with us as we fix leaderboard technical difficulties.|
|18 March, 2019||The task page is finalized and reference solutions are up.|
|05 March, 2019||The new contest page is up. The task will be announced soon!|
Student teams from degree-granting institutions are invited to compete in the annual SIGMOD Programming Contest. The winning team will be awarded a prize of USD $7,000, and there will be an additional prize of USD $3,000 for the runner-up. Teams' submissions will be judged on their overall performance on a supplied workload. One member from each of the top five teams will get a travel grant to go to the SIGMOD 2019 conference.
For this year's contest, the task is based on efficient sorting. Contestants must sort four datasets of varying size, the final sort to be verified for correctness. The winner will be the team that does this in the fastest aggregate time for all datasets.
More details about this year's problem can be found on the task page.
|5 March, 2019||Contest requirements specification and test data available.|
|19 March, 2019||Team registration begins. Leaderboard available.|
|2 May, 2019, 23:59 CEST (UTC+02:00)||Final submission deadline.|
|5 May, 2019||Finalists notified.|
|Prize money is donated by Amazon.|