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 listSep 19, 2026 15:23Andrew EpsteinAndrew EpsteinScore: 2,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:242,93732,842,77023,065,0001,019,00020,480
2Sep 19, 2026 15:242,93932,881,78523,089,0001,011,00020,480
3Sep 19, 2026 15:242,93932,915,17523,039,0001,062,00020,480
4Sep 19, 2026 15:242,94232,953,05323,103,0001,029,00020,480
5Sep 19, 2026 15:242,95233,000,87123,179,0001,034,00020,480
6Sep 19, 2026 15:242,96633,119,28723,275,0001,049,00020,480
7Sep 19, 2026 15:242,99433,414,42523,524,0001,032,00020,480
8Sep 19, 2026 15:2420,801179,384,621169,566,0001,006,00020,480
9Sep 19, 2026 15:2421,176182,479,774172,636,0001,010,00020,480