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 listJul 8, 2025 22:00Valentin KofmanValentin KofmanScore: 5,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2025 22:005,24567,720,91136,009,0007,001,0002,428,928
2Jul 8, 2025 22:005,29969,078,74234,360,0009,095,0002,420,736
3Jul 8, 2025 22:005,31174,306,51038,484,0005,063,0002,277,376
4Jul 8, 2025 22:005,34368,068,32535,846,0007,965,0002,510,848
5Jul 8, 2025 22:005,35066,367,77134,895,0008,973,0002,469,888
6Jul 8, 2025 22:005,35670,472,99233,937,0009,981,0002,502,656
7Jul 8, 2025 22:005,36367,913,63734,979,0008,994,0002,424,832
8Jul 8, 2025 22:005,52373,519,48237,240,0008,051,0002,441,216
9Jul 8, 2025 22:005,52972,688,13637,279,0008,060,0002,322,432