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:54Zhou180Zhou180Score: 21,767Success
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:553,51938,004,97527,806,0001,053,0002,117,632
2Jun 26, 2026 07:553,55738,319,36228,123,0001,050,0002,117,632
3Jun 26, 2026 07:5521,506185,491,998174,341,0002,012,0002,117,632
4Jun 26, 2026 07:5521,704187,136,061174,971,0003,009,0002,117,632
5Jun 26, 2026 07:5521,767187,604,653176,480,0002,011,0002,117,632
6Jun 26, 2026 07:5521,791187,886,552176,682,0002,011,0002,117,632
7Jun 26, 2026 07:5521,908188,752,919177,638,0002,010,0002,117,632
8Jun 26, 2026 07:5521,917188,825,819177,712,0002,011,0002,117,632
9Jun 26, 2026 07:5522,132190,711,088179,477,0002,012,0002,117,632