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 6, 2025 15:17Valentin KofmanValentin KofmanScore: 16,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 15:1716,920161,220,992136,752,0001,996,0002,351,104
2Jul 6, 2025 15:1716,989162,390,762139,311,00002,351,104
3Jul 6, 2025 15:1717,089162,325,929139,133,0001,000,0002,404,352