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 13:58Martin StensgårdMartin StensgårdScore: 52,212Success
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 13:5852,061495,188,266426,902,03202,199,552
2May 15, 2023 13:5852,212488,624,561428,134,75902,215,936
3May 15, 2023 13:5852,404498,435,898429,712,47802,207,744