I was about to sort them by letter count, but there's a txt of 4 letter handles: <a href="http://peticol.as/twitter-handles/4-letter-ok-sounding.txt" rel="nofollow">http://peticol.as/twitter-handles/4-letter-ok-sounding.txt</a>
Output at <a href="http://pastebin.com/18vCegaT" rel="nofollow">http://pastebin.com/18vCegaT</a><p>grep -P '(phobe|phile|ist)\s*$'<p>@categorist or @pantywaist, anyone?
Hard to believe @abdominohysterectomy is still available. Jackpot.<p>Edit: Equally fortunate: abdominohysterectomy.com is available.<p><a href="http://www.whois.com/whois/abdominohysterectomy.com" rel="nofollow">http://www.whois.com/whois/abdominohysterectomy.com</a><p>Jokes asides, it would be useful to cross check this with domain availability and username availability on other _popular_ social sites.
This is OT: I've always wanted to take a crack at a couple of problems/semi-thought-experiments I came up with:<p>1) Find the verified Twitter account followed by minimum number of users - This is easy, since Twitter maintains an official list of verified accounts at <a href="https://twitter.com/verified/following" rel="nofollow">https://twitter.com/verified/following</a> . We could iterate over this list, and find the minimum.<p>2) Find the maximum-followed non-verified Twitter account. Now this is a harder problem. Does anyone have any ideas apart from brute-forcing Twitter handles?
I made a python script for this purpose a while back. Supports brute force and dictionaries.<p><a href="https://github.com/process/Twitter-Name-Finder" rel="nofollow">https://github.com/process/Twitter-Name-Finder</a>
One short-ish reasonable sounding one I was surprised wasn't taken was "kobold"...you'd think that some tabletop gaming fan somewhere would have gotten that one!
This is why I like Perl,<p><pre><code> perl -e 'print sort{length $a <=> length $b} <>' english-words.txt > sorted.txt</code></pre>