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 listMar 4, 2026 14:48olliecrowolliecrowScore: 12,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 14:4812,125126,842,05497,417,0002,008,0002,408,448
2Mar 4, 2026 14:4812,139128,854,35597,529,0002,010,0002,424,832
3Mar 4, 2026 14:4812,141130,198,12499,558,00002,412,544
4Mar 4, 2026 14:4812,160129,433,93298,713,000997,0002,416,640
5Mar 4, 2026 14:4812,160123,587,72498,714,000997,0002,453,504
6Mar 4, 2026 14:4812,161126,191,94497,729,0001,994,0002,408,448
7Mar 4, 2026 14:4812,162131,542,12696,735,0002,991,0002,514,944
8Mar 4, 2026 14:4812,164129,619,94698,749,000997,0002,441,216
9Mar 4, 2026 14:4812,184129,143,21697,912,0001,998,0002,359,296