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 21, 2024 07:15Huy Duc LeHuy Duc LeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 07:1500000Error: No answer to stdout. Died or killed?stderr
2Feb 21, 2024 07:1500000Error: expected "2333602742 ", got "2147483648 "stderr
3Feb 21, 2024 07:1600000Error: expected "2217307182 ", got "2147483648 "stderr
4Feb 21, 2024 07:1600000Error: No answer to stdout. Died or killed?stderr
5Feb 21, 2024 07:177,199126,434,48359,032,63802,228,224
6Feb 21, 2024 07:177,674132,105,67562,929,67002,248,704
7Feb 21, 2024 07:177,989128,549,71765,513,35002,195,456