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 20, 2022 04:36Kenneth MaplesKenneth MaplesScore: 117,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2022 04:36109,103954,880,949894,643,03402,269,184
2Sep 20, 2022 04:36117,5381,039,117,040963,814,17202,240,512
3Sep 20, 2022 04:36118,0911,035,180,623968,344,02702,273,280