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 06:47Zhou180Zhou180Score: 3,911Success
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 06:483,85340,678,76029,497,0002,098,0002,117,632
2Jun 26, 2026 06:483,86540,846,03629,528,0002,168,0002,117,632
3Jun 26, 2026 06:483,89241,078,98229,730,0002,191,0002,117,632
4Jun 26, 2026 06:483,90941,276,48229,824,0002,235,0002,117,632
5Jun 26, 2026 06:483,91141,183,22229,911,0002,162,0002,117,632
6Jun 26, 2026 06:483,91541,266,04829,917,0002,188,0002,117,632
7Jun 26, 2026 06:483,97941,779,35030,352,0002,280,0002,117,632
8Jun 26, 2026 06:484,07442,540,90831,360,0002,052,0002,117,632
9Jun 26, 2026 06:4821,705187,113,328174,721,0003,262,0002,117,632