Real Vim ninjas count every keystroke - do you?

Pick a challenge, fire up Vim, and show us what you got.

Changelog, Rules & FAQ, updates: @vimgolf, RSS.

Your VimGolf key: please sign in

$ gem install vimgolf
$ vimgolf setup
$ vimgolf put [challenge ID]

Played Challenges

hexagram binary tree - 101 entries

generate the binary tree that represents all possible hexagrams found in the book of changes (易经)

  • Best score: 24
  • Best player score: 32
  • Position: #13 / 24
  • Number of attempts: 3
From brakets to parens - 1306 entries

This is one of the most common problem when you wrap an array for error handling. Vim is useful when you convert foo[i][j][k] into foo(i, j, k) for many times.

  • Best score: 24
  • Best player score: 32
  • Position: #112 / 295
  • Number of attempts: 5
yit6
Github:

entered into 2 challenges

contributed 0 challenges