You can recreate the magic in bash: while true; do printf "\u$((2571 + ($RANDOM & 1)))"; done
Fun task: write a program which takes such output, identifies all enclosed cells, and breaks them open, so that the maze is connected: any two points in the maze are connected by at least one path.
Bonus: close loops, so any two places in the maze are connected by a unique path.
As a preprocessing step, reformat the data to 77-column-long lines first, removing any whitespace characters, and discarding the last line if it is shorter than 79 characters, and then close off the exterior with solid zig-zags, like this, which are strictly added to the data (no overwriting):
╱╲╱╲╱╲...╱╲╱╲╱╲╱╲
╲╱╲╲╲╲...╲╱╱╲╱╲╱╱
╱╲╲╲╱╱...╱╲╱╱╲╱╲╲
╲╱╲╲╱╲...╲╱╲╲╱╱╲╱
: :
. .
╱╱╲╲╱╲...╱╱╲╱╲╱╲╲
╲╲╱╲╲╱...╱╱╱╲╲╱╲╱
╱╱╱╲╲╱...╱╱╱╲╱╲╱╲
╲╱╲╱╲╱...╲╱╲╱╲╱╲╱