Quixey Challenge

Submit

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

Hi, quixey is doing a programming challenge to try to recruit talent. You can win $100 if you solve the problem in 1 minute or less, and it is very doable (I just won, although last time I tried and did not).

The challenge is to find a bug in 1 minute or less. It is in python and pretty simple. You will need to talk over skype when it is your turn.

I apologize for this is somewhat spammy, but I think many golfers would be good at this and have a good chance of winning. (And I am selfish, if you win with this referral link, then I get 50$ :)

Below is an example problem (from the practice set)

Good Luck,
flagitious

http://www.quixeychallenge.com/?ref=darrenks314

Options

exec is denied

now post-mortem time, all source codes will be revealed

Sample input:_

def topological_ordering(nodes):
    ordered_nodes = OrderedSet(node for node in nodes if not node.incoming_nodes)
    
    for node in ordered_nodes:
        for nextnode in node.outgoing_nodes:
            if ordered_nodes.issuperset(nextnode.outgoing_nodes):
                ordered_nodes.add(nextnode)
    return ordered_nodes

Sample output:

def topological_ordering(nodes):
    ordered_nodes = OrderedSet(node for node in nodes if not node.incoming_nodes)
    
    for node in ordered_nodes:
        for nextnode in node.outgoing_nodes:
            if ordered_nodes.issuperset(nextnode.incoming_nodes):
                ordered_nodes.add(nextnode)
    return ordered_nodes

Ranking

Ruby _

Perl _

Python _

PHP _

Scheme _

Io _

JavaScript _

Lua _

Xtal _

Kite _

Icon _

REXX _

BASIC _

J _

C _

Haskell _

Java _

Pascal _

Fortran _

Maxima _

Asymptote _

AWK _

sed _

jq _

Bash _

Zsh _

Fish _

wake _

R _

Brainfuck _

GolfScript _

z80 _

Vim _

goruby _

Groovy _

Logo _

Language Ranking_

return to the top page