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 listSep 24, 2026 07:36Kevin HeaveyKevin HeaveyScore: 2,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 07:372,57430,512,08520,088,0001,022,00020,480
2Sep 24, 2026 07:372,57729,824,54620,119,0001,016,00020,480
3Sep 24, 2026 07:372,58029,928,00920,137,0001,026,00020,480
4Sep 24, 2026 07:372,58329,910,93920,146,0001,038,00020,480
5Sep 24, 2026 07:372,58429,902,14920,157,0001,039,00020,480
6Sep 24, 2026 07:372,58930,629,72420,189,0001,041,00020,480
7Sep 24, 2026 07:372,59430,130,29620,120,0001,153,00020,480
8Sep 24, 2026 07:377,52570,995,70959,680,0002,031,00020,480
9Sep 24, 2026 07:377,98674,946,03063,464,0002,025,00020,480