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 listMay 16, 2023 18:15Martin StensgårdMartin StensgårdScore: 16,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2023 18:1515,623198,415,684128,110,15402,269,184
2May 16, 2023 18:1516,189192,324,889132,749,37002,252,800
3May 16, 2023 18:1516,812206,263,782137,856,50902,199,552