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 listJun 4, 2023 21:11Franek KortaFranek KortaScore: 15,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2023 21:1114,830181,645,158121,607,17002,281,472
2Jun 4, 2023 21:1115,773181,080,544129,338,82502,285,568
3Jun 4, 2023 21:1116,329185,454,602133,900,09802,289,664