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 15, 2023 12:23Martin StensgårdMartin StensgårdScore: 361,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2023 12:23358,3498,392,019,7962,938,458,21802,301,952
2May 15, 2023 12:23361,4558,140,686,0772,963,927,92202,265,088
3May 15, 2023 12:23366,1638,405,135,2033,002,534,07402,187,264