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 6, 2023 23:07Franek KortaFranek KortaScore: 16,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2023 23:0715,632188,574,766128,185,89902,170,880
2May 6, 2023 23:0716,868195,557,309138,319,51102,236,416
3May 6, 2023 23:0718,058208,229,053148,074,33402,240,512