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:07Zhou180Zhou180Score: 22,025Success
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:083,46037,515,22427,329,0001,043,0002,117,632
2Jun 26, 2026 09:083,46637,539,83627,382,0001,042,0002,117,632
3Jun 26, 2026 09:0821,850188,310,043177,165,0002,011,0002,117,632
4Jun 26, 2026 09:0822,018189,617,733178,541,0002,012,0002,117,632
5Jun 26, 2026 09:0822,025189,741,923178,601,0002,009,0002,117,632
6Jun 26, 2026 09:0822,228191,516,587179,265,0003,011,0002,117,632
7Jun 26, 2026 09:0822,298191,995,502179,827,0003,022,0002,117,632
8Jun 26, 2026 09:0822,641194,895,362183,652,0002,011,0002,117,632
9Jun 26, 2026 09:0822,686195,190,980183,017,0003,009,0002,117,632