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 10, 2022 19:01eldon-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 10, 2022 19:0100000Error: expected "1989141500 ", got "-1"stderr
2Sep 10, 2022 19:0200000Error: expected "2034127272 ", got "-1"stderr
3Sep 10, 2022 19:0200000Error: expected "2048046595 ", got "-1"stderr
4Sep 10, 2022 19:0119,922223,020,169163,359,74302,236,416
5Sep 10, 2022 19:0119,956242,588,928163,637,44902,310,144
6Sep 10, 2022 19:0120,013234,543,017164,102,61802,203,648