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 8, 2022 17:48Franek KortaFranek KortaScore: 131,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2022 17:48113,700985,857,742932,336,94202,174,976
2Aug 8, 2022 17:48131,7981,136,214,8261,080,742,78902,179,072
3Aug 8, 2022 17:48135,3941,172,024,7911,110,229,31402,174,976