This one is actually a task in a level in password guessing game , well I thought the problem was interesting so i am blogging about it.

Here is the data dump . As you can see that there are more than 1000 lines of data and our password is one of them. The only hint is that the password occurs just once.

Well here is how i cracked this problem. First of all if our password occurs just once, so we should better get all the unique occurrences of the data.

So i used the uniq utility in unix like systems that got a reduced data dump. As you can see now the data is reduced to just 102 lines.

Now the approach is to find and output the password i.e the word occurring just once in the dump. For that it will take each word from the reduced dump at a time and get the count of its occurrence. Once we  find the one with single occurrence, it will be directed to output.

Here is the python code required to do this job for it.