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 09:14Zhou180Zhou180Score: 22,119Success
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 09:153,46838,841,51027,384,0001,054,0002,117,632
2Jun 26, 2026 09:153,50337,847,13727,659,0001,067,0002,117,632
3Jun 26, 2026 09:1521,883188,665,725177,432,0002,011,0002,117,632
4Jun 26, 2026 09:1521,925189,000,857177,776,0002,011,0002,117,632
5Jun 26, 2026 09:1522,119190,601,455179,365,0002,013,0002,117,632
6Jun 26, 2026 09:1522,162190,888,019179,721,0002,013,0002,117,632
7Jun 26, 2026 09:1522,292191,995,202179,776,0003,024,0002,117,632
8Jun 26, 2026 09:1522,360192,596,305181,343,0002,010,0002,117,632
9Jun 26, 2026 09:1522,415192,954,680181,793,0002,010,0002,117,632