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 listMay 7, 2026 18:29Pavel SkripkinPavel SkripkinScore: 7,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 18:306,90971,623,14748,753,0007,906,0002,359,296
2May 7, 2026 18:306,91275,164,21648,635,0008,045,0002,510,848
3May 7, 2026 18:306,93970,123,28648,882,0008,023,0002,301,952
4May 7, 2026 18:306,95572,956,02648,675,0008,364,0002,379,776
5May 7, 2026 18:307,05571,525,56049,731,0008,120,0002,301,952
6May 7, 2026 18:307,09671,844,46149,778,0008,410,0002,514,944
7May 7, 2026 18:307,10073,903,27749,660,0008,564,0002,383,872
8May 7, 2026 18:307,15576,504,55849,988,0008,690,0002,478,080
9May 7, 2026 18:307,33678,406,92851,052,0009,109,0002,314,240