F (2006)
It is often said that K can beat the speed of C for some tasks.<p>The name of this site is "nsl" for No Stinking Loops.<p>Here is an array programming challenge for the K programmers reading this thread.<p>There are two large files A and B.<p><pre><code>   File A
   AAAbjhOJxxxWXrCHt
   AAAsofxxxLqKbYOAwLMHG
   AAACgxxxOea
   AAAwfHjDtoJc
   AAAiCfYnbVXWhuvtEx
   AAAkzzQwvf
   AAAdjLalKFapoYAcGE
   AAAthGazmnfK
   etc.

   File B
   AAAwfHjDtoJc
   AAAbjhOJxxxWXrCHt
   AAAiCfYnbVXWhuvtEx
   AAACgxxxOea
   AAAkzzQwvf
   etc.
</code></pre>
The task is:<p>What are the lines in B that are not in A?<p>Something like<p><pre><code>   grep -vf B A
</code></pre>
But without the stinking loops!<p>EDIT: File A,B formatting