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 listOct 19, 2024 19:32zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2024 19:3100000Error: Exit with code 1: not a dynamic executable 67760 34386 37013 2008960618 1250000 620921 631099 2004991272 2004991272 3000000 2001991272 2007991272 99999744 100000000 2001991272 2007991272 50000000 100000000 2001991272 2007991272 49832757 122864 ...stderr
2Oct 19, 2024 19:322,96047,972,14023,263,0001,011,0002,289,664
3Oct 19, 2024 19:322,98648,962,99423,465,0001,020,0002,433,024
4Oct 19, 2024 19:322,98746,671,46722,450,0002,040,0002,535,424
5Oct 19, 2024 19:323,00054,956,22722,551,0002,050,0002,310,144
6Oct 19, 2024 19:323,00155,920,64823,582,0001,025,0002,400,256
7Oct 19, 2024 19:323,00451,621,66423,604,0001,026,0002,461,696
8Oct 19, 2024 19:323,00749,786,91123,629,0001,027,0002,498,560
9Oct 19, 2024 19:323,03247,477,07023,866,000994,0002,408,448
10Oct 19, 2024 19:323,04447,635,67322,963,0001,996,0002,437,120