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:06Valentin KofmanValentin KofmanScore: 7,291Success
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 22:067,11582,309,91445,269,00013,077,0002,330,624
2Jul 10, 2025 22:067,29190,674,45640,855,00018,933,0002,400,256
3Jul 10, 2025 22:067,61684,934,82043,313,00019,138,0002,338,816