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 12, 2022 20:49Egor SergeevEgor SergeevScore: 143,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2022 20:49143,4591,229,031,9651,176,359,90302,293,760
2Aug 12, 2022 20:49143,7621,245,246,4641,178,847,15602,301,952
3Aug 12, 2022 20:49144,6161,242,131,4221,185,849,89302,289,664