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 10:16Rajarshi BasuRajarshi BasuScore: 69,763Success
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 10:164,89767,688,28034,133,0006,023,0002,428,928
2Jan 6, 2026 10:165,37669,243,07740,077,0004,007,0002,523,136
3Jan 6, 2026 10:165,38575,718,89942,150,0002,007,0002,527,232
4Jan 6, 2026 10:165,39969,943,40436,222,0008,049,0002,486,272
5Jan 6, 2026 10:1669,763600,017,719443,041,000129,012,0002,412,544
6Jan 6, 2026 10:1671,420611,722,381462,719,000122,925,0002,519,040
7Jan 6, 2026 10:1676,141650,872,713510,477,000113,883,0002,375,680
8Jan 6, 2026 10:1683,075709,104,341554,359,000126,853,0002,367,488
9Jan 6, 2026 10:1686,614736,991,515589,365,000120,869,0002,412,544