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:36Zhou180Zhou180Score: 22,027Success
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:363,53638,168,54127,962,0001,041,0002,117,632
2Jun 26, 2026 07:3621,720187,290,429176,094,0002,011,0002,117,632
3Jun 26, 2026 07:3621,899188,799,709177,561,0002,012,0002,117,632
4Jun 26, 2026 07:3622,009189,638,144178,465,0002,009,0002,117,632
5Jun 26, 2026 07:3622,027189,789,262178,611,0002,011,0002,117,632
6Jun 26, 2026 07:3622,318192,183,641181,003,0002,012,0002,117,632
7Jun 26, 2026 07:3622,402192,868,937181,691,0002,012,0002,117,632
8Jun 26, 2026 07:3622,489193,717,753181,405,0003,011,0002,117,632
9Jun 26, 2026 07:3622,511193,814,695181,551,0003,047,0002,117,632