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 listJun 12, 2021 22:24Yuriy LyfenkoYuriy LyfenkoScore: 57,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 22:2453,429492,963,890438,120,75302,244,608
2Jun 12, 2021 22:2354,996517,730,419450,966,09202,207,744
3Jun 12, 2021 22:2455,759519,783,330457,221,92602,211,840
4Jun 12, 2021 22:2455,813512,546,606457,663,20702,240,512
5Jun 12, 2021 22:2357,412543,865,258470,780,51202,285,568
6Jun 12, 2021 22:2457,713531,820,686473,248,17402,183,168
7Jun 12, 2021 22:2459,227546,997,305485,663,80002,260,992
8Jun 12, 2021 22:2460,751557,466,369498,159,72002,220,032
9Jun 12, 2021 22:2360,909577,061,128499,453,87702,191,360