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 listJun 13, 2021 17:00Yuriy LyfenkoYuriy LyfenkoScore: 6,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 17:006,696113,227,99654,903,48202,220,032
2Jun 13, 2021 17:006,734122,441,62755,214,79302,220,032
3Jun 13, 2021 17:006,824120,664,17555,959,32902,224,128