Fast adjacency list reader

Reading of large adjacency lists is quite slow. Reading a 2.7G adjacency list
with EachLine and doing nothing else takes around 70 seconds. Reading the file
into /dev/null with dd takes 7 seconds.

fastadj attempts to speed things up by using readint chunks into an 8k Unit8
buffer. The numerical ascii encoded ordinals can be computed directly from
this buffer.