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 listOct 16, 2022 10:51Jules MinierJules MinierScore: 94,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2022 10:5186,677785,817,631710,754,44002,306,048
2Oct 16, 2022 10:5194,869843,816,479777,927,82602,174,976
3Oct 16, 2022 10:51100,166882,643,331821,364,95202,293,760