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 listNov 9, 2025 15:38Yehor BondarYehor BondarScore: 93,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 9, 2025 15:3881,681691,747,148493,843,000175,944,0002,465,792
2Nov 9, 2025 15:3883,957713,891,342510,589,000177,856,0002,277,376
3Nov 9, 2025 15:3891,470773,594,346574,276,000175,778,0002,306,048
4Nov 9, 2025 15:3893,094785,283,831586,516,000176,854,0002,428,928
5Nov 9, 2025 15:3893,306794,830,950588,313,000176,793,0002,301,952
6Nov 9, 2025 15:38100,360848,187,818646,180,000176,775,0002,486,272
7Nov 9, 2025 15:38106,561900,653,033701,038,000172,763,0002,265,088
8Nov 9, 2025 15:38110,235927,785,916726,138,000177,788,0002,494,464
9Nov 9, 2025 15:38111,473940,816,120735,256,000178,819,0002,277,376