Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listAug 14, 2026 23:27Tomislav TunkovicTomislav TunkovicScore: 2,707Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 23:282,69230,546,77520,963,0001,119,0002,113,536
2Aug 14, 2026 23:282,69530,662,39720,969,0001,131,0002,113,536
3Aug 14, 2026 23:282,70130,645,35021,032,0001,119,0002,113,536
4Aug 14, 2026 23:282,70430,778,83921,041,0001,134,0002,113,536
5Aug 14, 2026 23:282,70730,711,71821,088,0001,111,0002,113,536
6Aug 14, 2026 23:282,72630,632,80521,336,0001,021,0002,113,536
7Aug 14, 2026 23:282,82531,672,91422,032,0001,137,0002,113,536
8Aug 14, 2026 23:285,46153,842,59743,694,0001,087,0002,113,536
9Aug 14, 2026 23:285,46453,322,28443,727,0001,083,0002,113,536