[[FreeStyle C0ding Contest]]
 
You are here: Hackerspace Prague » Projects » FreeStyle C0ding Contest

STATUS:

Contact

<<<September 2021
2021/09/22 11:02		>>>
DayEvents
1
Wednesday		https://ntpc.wtf
2
Thursday		https://ntpc.wtf
3
Friday		https://ntpc.wtf
4
Saturday		https://ntpc.wtf
5
Sunday		https://ntpc.wtf
7
Tuesday		2000 meetup
14
Tuesday		2000 meetup
16
Thursday		BIOOKO - Big Brother film festival
21
Tuesday		VH (Valná Hromada) pravděpodobný termín 2000 meetup
22
Wednesday
28
Tuesday		2000 meetup
DayEvents

Sponsors

Table of Contents

FreeStyle C0ding Contest

FreeStyle C0ding Contest
zavod.jpg
founder: harvie
depends on:
interested:
software license:
hardware license:

Rules

  • harvie can override the jury, refuse task proposals or change anything else (but he cannot win anything)
  • jury member can refuse any task proposal or submission
  • jury member cannot submit (or win)
  • How will jury members rate submissions
    • If they will not meet the requirements give in task definition they will be disqualified
    • Task specific quality of solution will be rated (eg.: how strong compression is achieved)
    • If there will be two or more submissions with same quality, then speed will be rated
      • Using TimeBench (with low nice and ionice value, storing temporary files in ramdisk)
  • Common requirements for all submissions
    • Should work on Debian GNU/Linux
    • Should not need to install or compile any dependencies that are not included in official debian repositories (non-free packages are not supported!)
    • If compilation is needed you have to provide Makefile!
  • If you win you cannot get reward untill all code is publicly available (on web) and this wiki page links on it
  • Winner should make short talk about used alghorithms and programming techniques

Round #1 (status: gathering tasks, deadline: not yet)

Rewards (everyone can offer something)

donator prize
harvie 1st place can choose: Pilsner Beer, Kiss, Harvie's autogram on belly

Jury

  • Members
    • Harvie

Tasks

#1 - SubString optimalization

  • Find shortest string containing all of given (sub)strings (newline separated UTF-8 on STDIN)
    • (shortest string found wins :-)
  • Sample datasets
    • echo {00..99} | tr ' ' '\n'
    • echo {0000..9999} | tr ' ' '\n'
    • for i in {0..1000}; do echo -n $i | md5sum | head -c 5; echo; done
    • for i in {0..1000}; do head -c 1024 /dev/urandom | md5sum | head -c 10; echo; done
    • any other completely random strings
  • Example
    • input: 23, 42, 12, 34
    • output: 12342
  • Background story: hacking ancient answer machines :-)
project/coding_contest/start.txt · Last modified: 2016/11/28 02:50 by ruza
 
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki