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 listJan 6, 2026 16:29Rajarshi BasuRajarshi BasuScore: 5,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 16:294,93066,011,18934,363,0006,064,0002,342,912
2Jan 6, 2026 16:295,00566,130,20537,039,0004,004,0002,367,488
3Jan 6, 2026 16:295,44570,964,22540,592,0004,059,0002,502,656