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 listSep 28, 2023 14:27apuxbtapuxbtScore: 69,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 14:2767,373623,504,694552,454,93302,285,568
2Sep 28, 2023 14:2769,509640,865,467569,977,51702,289,664
3Sep 28, 2023 14:2769,875640,303,317572,978,49602,289,664