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 24, 2022 16:05Kenneth MaplesKenneth MaplesScore: 6,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2022 16:056,196121,516,89950,811,02302,285,568
2Oct 24, 2022 16:056,358105,209,76652,135,44602,269,184
3Oct 24, 2022 16:056,484131,682,27753,170,97902,285,568