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 listAug 2, 2022 18:15Yuriy 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
1Aug 2, 2022 18:1500000Error: expected "1962588563 ", got "384653039 "stderr
2Aug 2, 2022 18:159,986133,666,45881,886,64202,220,032
3Aug 2, 2022 18:1510,103164,054,18482,841,84302,228,224
4Aug 2, 2022 18:1510,139158,260,80183,140,62702,220,032