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 9, 2025 19:58Valentin KofmanValentin KofmanScore: 7,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2025 19:586,92086,484,60846,791,0009,955,0002,342,912
2Jul 9, 2025 19:587,36489,816,95242,268,00018,115,0002,342,912
3Jul 9, 2025 19:587,43184,471,41440,958,00019,979,0002,289,664