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 26, 2026 07:19Zhou180Zhou180Score: 21,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:203,60638,712,02528,538,0001,039,0002,117,632
2Jun 26, 2026 07:203,60738,744,87528,530,0001,054,0002,117,632
3Jun 26, 2026 07:203,61638,828,14328,609,0001,044,0002,117,632
4Jun 26, 2026 07:203,63538,962,38028,774,0001,034,0002,117,632
5Jun 26, 2026 07:2021,079181,921,804170,839,0002,014,0002,117,632
6Jun 26, 2026 07:2021,708187,168,182175,999,0002,014,0002,117,632
7Jun 26, 2026 07:2021,924188,924,260177,766,0002,011,0002,117,632
8Jun 26, 2026 07:2022,031189,783,217178,649,0002,012,0002,117,632
9Jun 26, 2026 07:2022,037189,884,119178,692,0002,012,0002,117,632