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 listMay 6, 2025 20:19Aniruddha DebAniruddha DebScore: 11,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 20:1911,457118,605,44992,947,000999,0002,433,024
2May 6, 2025 20:1911,477118,858,15393,112,0001,001,0002,293,760
3May 6, 2025 20:1911,556119,592,77893,763,000997,0002,416,640
4May 6, 2025 20:1911,569120,158,82094,869,00002,289,664
5May 6, 2025 20:1911,574122,856,58692,906,0001,997,0002,482,176
6May 6, 2025 20:1911,607118,594,64593,175,0002,003,0002,412,544
7May 6, 2025 20:1911,631116,358,56995,372,00002,310,144
8May 6, 2025 20:1911,650119,802,36093,518,0002,011,0002,510,848
9May 6, 2025 20:1911,796121,731,54995,729,000997,0002,330,624