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 2, 2022 18:11Yuriy LyfenkoYuriy LyfenkoScore: 8,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 18:118,510137,195,53669,777,95002,195,456
2Aug 2, 2022 18:118,527123,800,02769,922,36202,224,128
3Aug 2, 2022 18:118,696138,159,23971,308,93302,232,320