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 23:37Valentin KofmanValentin KofmanScore: 7,255Success
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 23:377,10389,333,87445,191,00013,055,0002,383,872
2Jul 8, 2025 23:377,25583,596,85943,359,00016,133,0002,338,816
3Jul 8, 2025 23:377,29186,009,86542,845,00016,938,0002,330,624