User blog comment:Deedlit11/Bignum Bakeoff appetizer/@comment-5529393-20140915222724

Just to check, I tried to adjust Vel's code to implement Bashicu's algorithm, and got:

x(w, t) { int k = 8, g = w, b; 	if (w & 7) { W ((g /= 8) & 7) >= (w & 7)) k *= 8; 		b = w % k - 1; 		w = g 		W t--) w = w * k + b; 	} else w /= 8 R main { int m = 5349, w = 2 W m) 		m = x(m, w++) 	R
 * 1) define W ; while (
 * 2) define R ; return w; }

adding up to 155 characters. Perhaps it could be improved.