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:39Zhou180Zhou180Score: 21,873Success
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:403,55238,371,60528,064,0001,065,0002,117,632
2Jun 26, 2026 07:403,55439,635,40128,098,0001,051,0002,117,632
3Jun 26, 2026 07:403,56438,274,28028,184,0001,041,0002,117,632
4Jun 26, 2026 07:403,56838,491,26328,222,0001,043,0002,117,632
5Jun 26, 2026 07:4021,873188,606,786176,307,0003,052,0002,117,632
6Jun 26, 2026 07:4022,036189,787,143177,622,0003,080,0002,117,632
7Jun 26, 2026 07:4022,381192,678,858180,507,0003,025,0002,117,632
8Jun 26, 2026 07:4022,593194,464,116182,235,0003,029,0002,117,632
9Jun 26, 2026 07:4022,730195,538,833184,373,0002,013,0002,117,632