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 08:44Zhou180Zhou180Score: 22,096Success
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 08:453,71539,719,25429,428,0001,037,0002,117,632
2Jun 26, 2026 08:453,73441,019,90029,577,0001,042,0002,117,632
3Jun 26, 2026 08:453,75539,925,31429,741,0001,054,0002,117,632
4Jun 26, 2026 08:453,80140,329,86330,114,0001,060,0002,117,632
5Jun 26, 2026 08:4522,096190,321,292179,184,0002,011,0002,117,632
6Jun 26, 2026 08:4522,178191,025,894179,855,0002,012,0002,117,632
7Jun 26, 2026 08:4522,214191,276,826180,151,0002,011,0002,117,632
8Jun 26, 2026 08:4522,454193,244,819182,116,0002,010,0002,117,632
9Jun 26, 2026 08:4522,831196,370,382184,196,0003,022,0002,117,632