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 7, 2025 10:45Valentin KofmanValentin KofmanScore: 15,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2025 10:4515,653155,663,815127,349,0001,002,0002,375,680
2Jul 7, 2025 10:4515,833154,011,225127,832,0001,997,0002,510,848
3Jul 7, 2025 10:4516,629163,502,351136,357,00002,355,200