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 listOct 30, 2021 22:46Jules MinierJules MinierScore: 103,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2021 22:46102,760907,744,988842,628,26002,260,992
2Oct 30, 2021 22:46103,329912,189,857847,296,12902,195,456
3Oct 30, 2021 22:46104,285911,735,698855,136,23602,293,760