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 listSep 11, 2022 13:02Bernard TeoBernard TeoScore: 105,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2022 13:0283,932751,395,635688,242,28202,293,760
2Sep 11, 2022 13:02105,913921,537,859868,488,58702,301,952
3Sep 11, 2022 13:02122,1981,071,713,8241,002,022,08802,273,280