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 17:22Andrew EpsteinAndrew EpsteinScore: 2,757Success
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 17:232,74531,893,44621,464,0001,049,00020,480
2Sep 19, 2026 17:232,74631,911,93921,486,0001,038,00020,480
3Sep 19, 2026 17:232,75131,435,41921,535,0001,030,00020,480
4Sep 19, 2026 17:232,75631,398,74121,536,0001,068,00020,480
5Sep 19, 2026 17:232,75731,447,26321,584,0001,024,00020,480
6Sep 19, 2026 17:2319,300167,811,741157,236,0001,032,00020,480
7Sep 19, 2026 17:2320,430177,556,335166,490,0001,040,00020,480
8Sep 19, 2026 17:2320,593178,034,773167,831,0001,039,00020,480
9Sep 19, 2026 17:2321,286183,355,824173,538,0001,015,00020,480