Can uniqueness of strings (each with an equal number of 1's and 0's) be decided in logspace?
Hint: let $n={k \choose k/2}$.  Consider the state of the algorithm after reading $n/2$ of the sequences.  How many possible states are there, that it could be in at that point?