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 21, 2026 19:22A_ShamanA_ShamanScore: 34,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 19:2334,388291,005,90995,312,000186,674,0002,113,536
2Jun 21, 2026 19:2334,410291,330,29699,383,000182,783,0002,113,536
3Jun 21, 2026 19:2334,433291,526,00996,634,000185,724,0002,113,536
4Jun 21, 2026 19:2334,566294,621,51798,361,000185,087,0002,113,536
5Jun 21, 2026 19:2334,721293,784,110103,870,000180,849,0002,113,536
6Jun 21, 2026 19:2334,910295,328,144103,788,000182,478,0002,113,536
7Jun 21, 2026 19:2335,008296,125,978103,364,000183,704,0002,113,536
8Jun 21, 2026 19:2335,286298,559,168107,601,000181,745,0002,113,536
9Jun 21, 2026 19:2335,638301,366,346104,967,000187,265,0002,113,536