TSORT  Turbo Sort
Given the list of numbers, you are to sort them in non decreasing order.
Input
t – the number of numbers in list, then t lines follow [t <= 10^6].
Each line contains one integer: N [0 <= N <= 10^6]
Output
Output given numbers in non decreasing order.
Example
Input:
5 5 3 6 7 1
Output:
1 3 5 6 7
hide comments
Lai Manh Tuan:
20130110 06:59:21
Time limit is too strict


Onur:
20130109 20:37:38
why i couldnt get AC with lineer sort?


(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20121220 12:08:57
found an algorithm that faster than merge sort ;) 

Deepan:
20120913 04:26:44
got AC using STL :) but merge sort , heap sort failed 

anuj kumar:
20120826 05:39:43
Got AC with merge sort... :) :) 

radical:
20120728 04:43:37
any solve with python? i try with quick sort and list.sort and the result is Time limit :( 

Out0fbounds:
20120514 03:36:52
used stl and got ac 

Julian Leyh:
20120209 13:57:38
Time limit very strict for Ada, too. Need about 5s to input, sort, and output 10^6 random integers with N*log(N) algorithm.


Eric Marthinsen:
20111115 18:14:29
The time limit on this problem is too low. No one using an interpreted language has been able to get an accepted solution. 

Abhishek Mishra:
20111006 04:28:34
what we have to use it here is it radix sort... 
Added by:  Roman Sol 
Date:  20050314 
Time limit:  2.700s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ZCon 