Is it possible to hit the size target on year 32 - Creative Writhing - legitimately?

[menderbug]

By "legitimately" I mean without writing a random, stupid and slow solution. It seems like there should be a good way to use "nearest" to move along each trail, but since it prioritises top before the other sides, they never get past the first couple of cubes.

I'd prefer hints over exact solutions.

[yifeixuer]

mem1 = nearest datacube
a:
pickup mem1
mem1 = nearest datacube
write 99
step n
drop
if mem1 == 0:
jump a
endif

[menderbug]

Thanks?