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 listApr 22, 2026 17:34olliecrowolliecrowScore: 23,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 17:353,29244,527,96424,999,0001,999,0002,301,952
2Apr 22, 2026 17:353,29643,739,71025,033,0002,002,0002,379,776
3Apr 22, 2026 17:353,30541,995,45224,093,0003,011,0002,506,752
4Apr 22, 2026 17:3523,728211,082,865191,581,0002,993,0002,555,904
5Apr 22, 2026 17:3523,764211,869,698191,874,0002,998,0002,539,520
6Apr 22, 2026 17:3523,772215,073,795191,933,0002,998,0002,551,808
7Apr 22, 2026 17:3523,772210,458,070191,936,0002,999,0002,527,232
8Apr 22, 2026 17:3523,781210,803,898191,005,0004,000,0002,408,448
9Apr 22, 2026 17:3523,914215,080,300194,100,0002,001,0002,367,488