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 listFeb 20, 2023 00:46LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2023 00:4400000Error: expected "2260523059 ", got " "stderr
2Feb 20, 2023 00:4400000Error: expected "2232638935 ", got " "stderr
3Feb 20, 2023 00:4500000Error: expected "2248052319 ", got " "stderr
4Feb 20, 2023 00:4600000Error: expected "2250217951 ", got " "stderr
5Feb 20, 2023 00:4600000Error: No answer to stdout. Died or killed?
6Feb 20, 2023 00:4600000Error: No answer to stdout. Died or killed?
7Feb 20, 2023 00:4600000Error: No answer to stdout. Died or killed?
8Feb 20, 2023 00:4600000Error: No answer to stdout. Died or killed?
9Feb 20, 2023 00:4800000Error: No answer to stdout. Died or killed?
10Feb 20, 2023 00:4636,985370,943,363303,278,89302,277,376
11Feb 20, 2023 00:4637,931385,824,968311,037,51902,285,568
12Feb 20, 2023 00:4638,643382,845,165316,875,57502,281,472