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 listSep 8, 2026 11:35Victor MerckléVictor MerckléScore: 2,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 11:412,55429,298,01320,948,000024,576stderr
2Sep 8, 2026 11:412,55529,316,46920,952,000024,576stderr
3Sep 8, 2026 11:412,56130,793,62021,007,000024,576stderr
4Sep 8, 2026 11:412,58529,539,88421,203,000024,576stderr
5Sep 8, 2026 11:412,63030,666,16221,566,000024,576stderr
6Sep 8, 2026 11:412,63330,694,20321,596,000024,576stderr
7Sep 8, 2026 11:412,64230,072,90621,666,000024,576stderr
8Sep 8, 2026 11:412,66530,089,29921,857,000024,576stderr
9Sep 8, 2026 11:415,50154,188,00744,097,0001,013,00024,576stderr