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 15:53Kenneth MaplesKenneth MaplesScore: 7,012Success
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 15:566,955117,091,82457,028,62302,240,512
2Oct 24, 2022 15:536,974125,664,59757,183,63102,248,704
3Oct 24, 2022 15:566,993110,838,44557,343,53302,211,840
4Oct 24, 2022 15:537,012119,183,91157,495,83002,187,264
5Oct 24, 2022 15:567,062121,573,37557,904,93402,301,952
6Oct 24, 2022 15:537,187125,879,12558,933,91102,293,760