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 7, 2025 23:42Valentin KofmanValentin KofmanScore: 10,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2025 23:4210,212114,837,39181,749,0001,993,0002,363,392
2Jul 7, 2025 23:4210,236110,728,14781,937,0001,998,0002,367,488
3Jul 7, 2025 23:4210,454108,475,55184,723,000996,0002,363,392