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 listSep 30, 2023 19:05apuxbtapuxbtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2023 19:0400000Error: Exit with code 255: stage1, total(ms):63 clt = 51903294stderr
2Sep 30, 2023 19:0518,322218,783,665150,243,16002,215,936
3Sep 30, 2023 19:0518,354211,185,197150,505,73302,215,936
4Sep 30, 2023 19:0519,107219,926,989156,679,82502,228,224