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 10, 2025 22:10Valentin KofmanValentin KofmanScore: 7,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2025 23:366,83180,462,72140,012,00016,005,0002,473,984
2Jul 10, 2025 22:106,83979,659,26741,056,00015,020,0002,265,088
3Jul 10, 2025 23:367,08083,922,06342,042,00016,016,0002,355,200
4Jul 10, 2025 22:107,13886,073,72736,331,00022,202,0002,506,752
5Jul 10, 2025 22:107,17382,225,29841,870,00016,947,0002,510,848
6Jul 10, 2025 23:367,77693,750,68440,849,00022,915,0002,387,968