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 29, 2024 23:23Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2024 23:2300000Error: No answer to stdout. Died or killed?stderr
2May 29, 2024 23:246,120113,791,56750,180,07802,228,224
3May 29, 2024 23:248,146131,974,72766,800,02702,281,472
4May 29, 2024 23:248,370140,519,11668,636,76502,252,800
5May 29, 2024 23:248,780139,581,31671,998,70702,240,512
6May 29, 2024 23:249,701154,942,62479,544,11402,240,512
7May 29, 2024 23:2410,158153,678,09083,296,79102,224,128