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 listApr 15, 2023 22:16Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2023 22:1500000Error: No answer to stdout. Died or killed?stderr
2Apr 15, 2023 22:1600000Error: No answer to stdout. Died or killed?stderr
3Apr 15, 2023 22:1646,892440,494,042384,513,23802,248,704
4Apr 15, 2023 22:1648,733461,194,672399,614,62202,256,896
5Apr 15, 2023 22:1649,236471,035,648403,738,84802,211,840