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 listApr 23, 2023 21:05Franek KortaFranek KortaScore: 11,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2023 21:0511,588153,593,60095,022,58002,224,128
2Apr 23, 2023 21:0511,998152,788,36498,381,29302,301,952
3Apr 23, 2023 21:0513,137163,769,447107,723,79002,211,840