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 20, 2024 19:59Joad 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 20, 2024 20:0000000Error: No answer to stdout. Died or killed?stderr
2May 20, 2024 20:0000000Error: expected "2222821840 ", got "0"stderr
3May 20, 2024 20:0000000Error: No answer to stdout. Died or killed?stderr
4May 20, 2024 20:0000000Error: No answer to stdout. Died or killed?
5May 20, 2024 20:008,398135,156,09168,862,59602,199,552
6May 20, 2024 20:008,815133,310,05372,279,69702,347,008
7May 20, 2024 20:009,099133,962,72674,607,87802,297,856
8May 20, 2024 20:009,118156,829,13774,769,62402,297,856
9May 20, 2024 20:009,523136,782,51678,089,55902,256,896
10May 20, 2024 20:0010,102153,628,13082,837,86202,244,608
11May 20, 2024 19:5910,536156,953,08486,393,45902,240,512
12May 20, 2024 19:5910,867155,549,61689,110,58602,228,224
13May 20, 2024 19:5911,183153,356,00191,704,42002,215,936