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 listJun 12, 2021 22:25Yuriy LyfenkoYuriy LyfenkoScore: 59,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 22:2557,318545,710,120470,007,20202,269,184
2Jun 12, 2021 22:2657,867535,802,515474,510,12502,277,376
3Jun 12, 2021 22:2659,395546,677,689487,037,98202,199,552
4Jun 12, 2021 22:2559,744545,884,923489,898,35402,244,608
5Jun 12, 2021 22:2659,929556,924,866491,421,30802,293,760
6Jun 12, 2021 22:2560,811571,835,877498,646,71602,306,048