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 |

K

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
1teebee23263482339984228
2twobit15556601599784125
3clock69385270991260
4Hendrik30857131995330
5lynn20701925828019
6av2009222483718
7pooq15979718887710
8Dingledooper10722211974710
9mitchs100000101000010
10%2047222594444
11@tttttanaka44126588252
12I., S.42963585921
13nooodl32373480932
14ikegami17222286111

Last update: Wed Nov 25 06:34:43 UTC 2020 (Wed Nov 25 15:34:43 +0900 2020)

return to the top page