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 7, 2023 04:33Yuriy LyfenkoYuriy LyfenkoScore: 5,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2023 04:335,354101,429,24743,902,11102,199,552
2May 7, 2023 04:335,465109,305,89444,815,86102,273,280
3May 7, 2023 04:335,474109,999,03844,884,31402,293,760