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 listJul 21, 2021 15:16Mikhail ShirokovMikhail ShirokovScore: 83,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2021 19:4874,823679,377,741613,551,84302,281,472
2Jul 21, 2021 15:1676,510689,333,241627,382,81102,269,184
3Jun 14, 2021 19:4881,454732,524,315667,920,34502,224,128
4Jun 14, 2021 19:4883,284744,894,631682,932,15602,281,472
5Jul 21, 2021 15:1690,092803,353,122738,756,61102,277,376
6Jul 21, 2021 15:16102,324891,717,967839,060,15802,277,376