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 15:45Robert BurkeRobert BurkeError
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 15:4500000Error: expected "2284880947 ", got "0 "stderr
2Aug 2, 2022 15:457,307115,095,31259,916,23502,195,456
3Aug 2, 2022 15:4510,241151,970,79883,977,61102,236,416
4Aug 2, 2022 15:4510,393143,805,63885,223,65102,260,992