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 21, 2026 00:40Taylor DettlingTaylor DettlingScore: 7,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 00:417,27382,649,51144,482,00015,164,0002,490,368
2Apr 21, 2026 00:417,29084,621,65642,842,00016,937,0002,482,176
3Apr 21, 2026 00:417,29583,711,76843,871,00015,953,0002,486,272
4Apr 21, 2026 00:417,42183,717,69744,897,00015,963,0002,478,080
5Apr 21, 2026 00:417,42583,681,54844,919,00015,971,0002,482,176
6Apr 21, 2026 00:417,42673,691,20443,928,00016,972,0002,412,544
7Apr 21, 2026 00:417,45873,737,75744,118,00017,045,0002,334,720
8Apr 21, 2026 00:417,46786,688,99045,173,00016,061,0002,482,176
9Apr 21, 2026 00:417,48483,667,78945,275,00016,098,0002,490,368