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 listMar 28, 2024 22:07woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 108,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2024 22:0769,169633,517,303567,184,00002,301,952
2Mar 28, 2024 22:07108,812958,948,134892,262,24202,301,952
3Mar 28, 2024 22:07110,508967,601,810906,165,50502,301,952