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 listOct 31, 2021 11:14Ilya AniskovetsIlya AniskovetsScore: 21,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2021 08:2320,460227,313,628167,769,20102,281,472
2Nov 11, 2021 08:2320,964238,639,150171,906,50002,269,184
3Oct 31, 2021 11:1421,016232,444,010172,331,18802,260,992
4Oct 31, 2021 11:1421,306226,495,578174,706,79602,269,184
5Oct 31, 2021 11:1421,797243,975,290178,735,00202,277,376
6Nov 11, 2021 08:2321,946240,252,319179,961,19902,277,376