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 listMar 27, 2024 20:30emily graceemily graceScore: 138,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 20:3176,046686,654,120623,576,04902,297,856
2Mar 27, 2024 20:30128,6461,113,371,8861,054,893,75402,297,856
3Mar 27, 2024 20:31131,7831,133,507,5941,080,616,97002,301,952
4Mar 27, 2024 20:30138,5221,199,482,3521,135,879,51902,301,952
5Mar 27, 2024 20:31139,8851,215,694,8181,147,057,54602,224,128
6Mar 27, 2024 20:30139,9711,215,540,4581,147,762,64402,293,760