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 12, 2021 21:10Yuriy LyfenkoYuriy LyfenkoScore: 132,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 21:1087,289777,813,914715,770,88702,215,936
2Jun 12, 2021 21:10132,1551,145,366,8861,083,668,30002,228,224
3Jun 12, 2021 21:10155,9251,343,352,4631,278,581,52102,220,032