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 12, 2023 22:43Martin StensgårdMartin StensgårdScore: 74,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2023 22:4373,652661,436,283603,949,44102,256,896
2May 12, 2023 22:4374,103677,718,865607,640,88002,232,320
3May 12, 2023 22:4378,058699,907,188640,079,22002,228,224