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 listAug 9, 2022 18:48deniskolsanovdeniskolsanovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2022 18:4700000Error: expected "2221694319 ", got "2214592510 "
2Aug 9, 2022 18:48105,1541,996,721,901862,260,00902,179,072
3Aug 9, 2022 18:48120,7854,087,678,035990,433,43902,248,704
4Aug 9, 2022 18:48132,0793,256,996,6621,083,047,35302,285,568