C :

#include<stdio.h>
#include<string.h>
void main()
{
    int i,j,k,l,t,m,o,n,u,b[1100];
    char a[1100];
    while(scanf("%s",a)!=EOF)
    {   o=0;
        l=0;u=0;
        for(i=0;i<strlen(a);i++)
        {m=0;if(a[i]!='5'){
            while(a[i]!='5')
            {
                m=m*10+a[i]-48;
                i++;if(i==strlen(a)){
               break;}
            }if(a[i-1]!='5')
            b[l++]=m;//printf("%d\n",b[l-1]);
        }
        }
            for(i=0;i<l;i++)
            {
                for(j=i+1;j<l;j++)
                if(b[i]>b[j])
                {
                    t=b[i];
                    b[i]=b[j];
                    b[j]=t;
                }
            }

                for(i=0;i<strlen(a);i++)
                {


                if(a[i]=='5')
                o++;

                }
                if(o==0&&a[0]!='0')
                printf("%s",a);


            else
            for(i=0;i<l;i++)
            {

                if(i==0)
                printf("%d",b[i]);
                else
                printf(" %d",b[i]);

            }
            printf("\n");

    }
}

C++ :

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;

int main()
{
	int i,k,m,c[1000];
	char a[1001],b[1001];
	while(gets(a))
	{
		m=0;
		for(k=i=0;i<=strlen(a);i++)
		{
			if(a[i]!='5')
				b[k++]=a[i];
			if((a[i]=='5'&&a[i-1]!='5'&&i!=0)||(a[i-1]!='5'&&a[i]=='\0'))
			{
				b[k]='\0';
				c[m++]=atoi(b);
				k=0;
			}
		}
		sort(c,c+m);
		for(i=0;i<m-1;i++)
			printf("%d ",c[i]);
		printf("%d\n",c[i]);
	}
	return 0;
}

Pascal :

program p1050;
var a:array[1..1000] of char;
    i,j,k,n,s:longint;
    b:array[1..1000] of longint;
    st:char;
begin

  while not eof  do
   begin
   fillchar(b,sizeof(b),0);
   i:=0; j:=0; s:=0;
   while not eoln do
   begin
     i:=i+1;
     read(a[i]);
   end;
   i:=i+1; a[i]:='5';
   readln;
   for k:=1 to i do
    begin
     if a[k]='5' then
     if k>1 then
     if a[k-1]<>'5' then
       begin
         j:=j+1;
         b[j]:=s;
         s:=0;
       end
     else
     else
       else
         begin
           s:=s*10+(ord(a[k])-ord('0'));
         end;
    end;
    n:=j;
    for i:=1 to n-1 do
      for j:=i+1 to n do
       if b[i]>b[j] then
       begin
         k:=b[i]; b[i]:=b[j]; b[j]:=k;
       end;
    for i:=1 to n-1 do
     write(b[i],' ');
    writeln(b[n]);
   end;
end.

Java :

import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		while(in.hasNext()){
			String s = in.next();
			s = s.replaceAll("5", " ");
			String[] ss = s.split(" ");
			ArrayList<Integer> list = new ArrayList<Integer>();
			for(String tem:ss)
				if(!tem.trim().equals(""))list.add(Integer.parseInt(tem));
			Collections.sort(list);
			StringBuffer sb = new StringBuffer();
			for(int i:list)
				sb.append(" ").append(i);
			System.out.println(sb.substring(1));
		}
	}

}

Python :

while True:
        string = raw_input()
        list1 = string.split('5')
        lst =[]
        for i in list1:
                if i!='':
                        lst.append(long(i))
        lst.sort()
        #print lst
        for j in lst[0:-1]:
                print j,
        print lst[-1]