Shell Programming and Scripting

In section 5.2.1 of the C Standard titled Character Sets it says:
In the POSIX Standards, XBD section 6.1 titled Portable Character Set places this requirement from the C Standard on all locales supported by a system conforming to the POSIX Standards or to the more stringent requirements of the Single UNIX Specification.

So, the -n isn't needed in sort when all of the strings of digits being sorted are all the same length.

Although it doesn't matter in this case, note that the same can't be said for uppercase letters nor lowercase letters. Adding 0 through 26 to 'a' ('A') to get the lowercase (uppercase) letters in sequence happens to work in supersets of ASCII, but it won't work in EBCDIC. There are gaps between 'i' and 'j' ('I' and 'J') and between 'r' and 's' ('R' and 'S') in EBCDIC.

Yes... But after fixing missing new line, length got reduced by one(still behind you and elixir..)
Now 84..

Code:

sort -n file | sed 's/./& /6' | awk '!X[$1]++{printf b?b"\n"$0" ":$0" "}{b=$2}END{print b}'

And with this 83..
actually i m not getting what i can call this, may be cheating/Not good way of programming but it also helps to reduce one count.
Still few more required..

Code:

sort -n file | sed 's/./& /6' | awk '!X[$1]++{printf b?" "b"\n"$0:$0}{b=$2}END{print k,b}'

Hello Don, your solution worked very nicely. Thanks for precise code.