Re: efficient version of 'sort | uniq -c | sort -n'?

[James Youngman]

On 5/21/07, Matthew Woehlke <address@hidden> wrote:
> Is there an efficient implementation of 'sort | uniq -c | sort -n'? I
> have a 4 GB core file I want to run 'strings' on, and the above is
> really slow.

I would suggest that the appropriate factorisation would be

countitems | sort -n

Here, countitems could be "sort" with some options or "uniq" with some
options...

James.