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:32Egor SergeevEgor SergeevScore: 44,780Success
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:3244,329434,212,795363,497,03502,265,088
2Aug 12, 2022 20:3244,780439,641,327367,196,26702,273,280
3Aug 12, 2022 20:3245,897452,917,669376,358,50402,269,184