User ranking

| Overall | ><> | A+ | Ada | Aheui | Arc | Asymptote | AWK | Bash | Bash (builtins) | BASIC | bc | Befunge | Befunge-98 | Brainfuck | Burlesque | C | C# | C++ | Chapel | CLC-INTERCAL | Clojure | COBOL | Common LISP | Crystal | Curry | Cyan | D | D-compile-time | dc | DOS | Erlang | Euphoria | FerNANDo | Fish | FlogScript | Forth | Fortran | gas | gnuplot | Go | GolfScript | goruby | Grass | Groovy | gs2 | Haskell | Hexagony | Icon | Io | J | Java | JavaScript | jq | JVM | K | Kite | Labyrinth | Lazy-K | LilyPond | LMNtal | Logo | Lua | m4 | make | Malbolge | Maxima | Mind | Minus | MNNBFSL | Nemerle | ObjC | OCaml | Octave | PARI/GP | Pascal | Pefunge | Perl | Perl6 | PHP | Piet | Pike | Postscript | Prolog | Python | Python3 | QCL | R | REBOL | REXX | Ruby | Ruby2 | Rust | Scala | Scheme | sed | Smalltalk | SNOBOL | Squirrel | Tcl | Universal Lambda | Unlambda | VHDL | Vim | wake | Whirl | Whitespace | x86 | xgawk | Xtal | z80 | Zsh |

Universal Lambda

The score is the sum of 10000 * <size of best solution> / <size of your solution> for each problems. Only submissions before the deadline are considered if the problem has the deadline. Parentheses after your name will be removed before the aggregation. If you submitted multiple solutions into a problem, the better one will be calculated. (E.g., suppose you submitted as "shinh (cheat)" and "shinh" and earned 10000 and 8000, respectively. Then, your total score will be added by 10000)

This ranking is not fair (especially for new comers). Please don't consider this so seriously, the intention of this ranking is to show how eager you are golfing :)

RankUserScoreEntriesAvg# of 10000
1hinoe290000291000029
2lynn21476024894821
3irori1215591486827
4%20100000101000010
5kaki800008100008
6leonid600006100006
7teebee500005100005
8mitchs500005100005
9@tttttanaka400004100004
10nooodl300003100003
11flagitious25517385052
12zzo38200002100002
13narb200002100002
14twobit200002100002

Last update: Wed Dec 12 06:35:06 UTC 2018 (Wed Dec 12 15:35:06 +0900 2018)

return to the top page