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 12, 2022 09:35eldon-chungeldon-chungError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2022 09:3500000Error: No answer to stdout. Died or killed?stderr
2Sep 12, 2022 09:3600000Error: expected "2159522479 ", got "1494444369 "stderr
3Sep 12, 2022 09:3600000Error: expected "2212498922 ", got "2200479297 "stderr
4Sep 12, 2022 09:3600000Error: expected "2109141581 ", got "257134735 "stderr
5Sep 12, 2022 09:3600000Error: expected "2108239007 ", got "265720663 "stderr
6Sep 12, 2022 09:3600000Error: No answer to stdout. Died or killed?stderr
7Sep 12, 2022 09:3600000Error: No answer to stdout. Died or killed?stderr
8Sep 12, 2022 09:3600000Error: No answer to stdout. Died or killed?stderr
9Sep 12, 2022 09:3600000Error: expected "2192826570 ", got "2138998949 "stderr
10Sep 12, 2022 09:3600000Error: expected "2266211721 ", got "2953012300 "stderr
11Sep 12, 2022 09:3600000Error: expected "2200670492 ", got "2157483918 "stderr