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 listJul 16, 2023 22:10Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 22:1100000Error: expected "2016660955 ", got "3174503122 "stderr
2Jul 16, 2023 22:108,318631,136,24068,207,73102,236,416
3Jul 16, 2023 22:108,381623,927,01368,726,60002,228,224
4Jul 16, 2023 22:108,409619,681,56068,952,40202,252,800