3 ms·
cut -d: -f2- | sort | uniq -c | sort -k2 -n
by __alexs 14y ago
cut -d: -f2- | sort | uniq -c | sort -k2 -n
- ralph 14y agoWhat's the input to that? Is it lines like 133438:remia.eu@hotmail.com:combinate
- __alexs 14y agoI hadn't seen the original data. Should probably be cut -d: -f3- then.
- ralph 14y agoIsn't the sort a bit odd too? To sort by uniq's frequency it's more like sort -k1n,1 -k2
- ralph 14y agoUnsure why the downvote since the original is wrong. To be clear, cut -d: -f3- | sort | uniq -c | sort -k2 -n would be sorting the output of uniq(1) by the password, treating them all as numeric. Depending on one's locale that gives results like 1 00auditt 100 babygirl 1 00beetle or 1 100671105192 1 100997162005jm 2 102030405060 1 102990091404
- gingerjoos 14y agoYup, I've the top 25 in a gist ( https://gist.github.com/3096776 https://gist.github.com/3096776 )