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 25, 2026 15:39Zhou180Zhou180Score: 24,339Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:3924,077206,564,838191,422,0006,011,0002,117,632
2Jun 25, 2026 15:3924,173207,389,115192,110,0006,111,0002,117,632
3Jun 25, 2026 15:3924,190207,509,161192,355,0006,005,0002,117,632
4Jun 25, 2026 15:3924,235207,837,377193,066,0005,663,0002,117,632
5Jun 25, 2026 15:3924,339208,781,805193,832,0005,753,0002,117,632
6Jun 25, 2026 15:3924,380209,125,311194,141,0005,780,0002,117,632
7Jun 25, 2026 15:3924,417209,367,725194,159,0006,067,0002,117,632
8Jun 25, 2026 15:3924,428209,559,579194,484,0005,829,0002,117,632
9Jun 25, 2026 15:3924,588210,811,034195,844,0005,778,0002,117,632