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
Bryan Poulsen:
20170215 19:45:50
I submitted the same solution 2 times with Python 3: first time I got WA, second time I got AC... Kind of random. Same solution works with python2.6  3.6 (minus the random single WA) 

tungtd95:
20161111 11:24:02
combsort is fine 

vigneshkv:
20161012 14:22:25
Counting sort got me AC !! :) 

Kaushal Pranav B:
20160721 07:25:23
Quicksort did not get accepted but merge sort did. 

square1001:
20160717 05:05:05
I submitted 2 submission (completely same code) and first I got TLE but second I got AC for 2.49 seconds!!! 

Christian López:
20160416 01:05:40
Too easy, so don't use cin/cout. 

lalit_nit:
20160120 12:48:27
stl sort +cin cout = 2.50


syed_tanveer:
20151112 12:10:30
Counting Sort works fine. 

sharif ullah:
20151020 15:47:15
quick sort give me TLE


Eugene Che:
20150809 18:39:22
Can I make iostream faster? It seems to be just so much slower than cstdio. Changing all my cin to scanf's and cout to printf's improved my program's speed by a factor of 10. 
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 