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 11, 2022 14:54Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2022 14:5400000Error: expected "2216772563 ", got "1"
2Sep 11, 2022 14:5500000Error: expected "2037694616 ", got "1"
3Sep 11, 2022 14:5700000Error: expected "2060527025 ", got "1"
4Sep 11, 2022 14:559,253146,131,74575,874,79702,174,976
5Sep 11, 2022 14:559,741146,994,23379,875,63702,269,184
6Sep 11, 2022 14:559,746145,583,69579,915,90902,183,168