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 listMay 11, 2025 23:52Christopher TarryChristopher TarryScore: 972,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 23:52967,3577,963,140,8907,739,493,000192,837,0002,277,376
2May 11, 2025 23:52969,3517,987,536,1597,765,828,000182,854,0002,277,376
3May 11, 2025 23:52969,4367,983,682,6137,747,568,000201,806,0002,277,376
4May 11, 2025 23:52971,8908,001,479,6887,769,658,000199,836,0002,277,376
5May 11, 2025 23:52972,8528,015,823,6257,780,548,000196,836,0002,277,376
6May 11, 2025 23:52973,2048,016,882,3627,786,437,000193,836,0002,277,376
7May 11, 2025 23:52973,7508,016,439,5987,782,912,000201,842,0002,277,376
8May 11, 2025 23:52974,9878,018,316,8737,795,049,000199,847,0002,293,760
9May 11, 2025 23:52977,6318,045,615,1707,819,731,000196,842,0002,363,392