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 listSep 30, 2023 18:17apuxbtapuxbtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2023 18:1400000Error: Exit with code 255: clt = 50162708 cgt = 44924650stderr
2Sep 30, 2023 18:1759,458560,179,402487,552,83002,301,952
3Sep 30, 2023 18:1762,513577,493,467512,603,51602,191,360
4Sep 30, 2023 18:1762,977584,824,748516,411,44502,195,456