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 11, 2025 20:01Valentin KofmanValentin KofmanScore: 7,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 20:016,96181,919,94041,056,00016,021,0002,506,752
2Jul 11, 2025 20:017,28890,071,67639,840,00019,920,0002,510,848
3Jul 11, 2025 20:017,74498,191,51147,372,00016,126,0002,273,280