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:13Franek KortaFranek KortaScore: 14,676Success
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:1314,416183,235,318118,208,01102,228,224
2Jun 4, 2023 21:1314,676183,578,284120,340,13302,260,992
3Jun 4, 2023 21:1315,185196,013,205124,513,93002,301,952