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 27, 2021 20:26alex3dalex3dScore: 140,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2021 20:26125,6781,112,688,2581,030,558,27702,306,048
2Jun 27, 2021 20:26140,2601,215,804,3261,150,132,55802,318,336
3Jun 27, 2021 20:26167,8641,435,460,2111,376,483,91002,314,240