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 18:04Andrew EpsteinAndrew EpsteinScore: 2,739Success
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 18:052,72631,227,82721,305,0001,054,00020,480
2Sep 19, 2026 18:052,73331,309,20421,364,0001,051,00020,480
3Sep 19, 2026 18:052,73631,033,42921,382,0001,059,00020,480
4Sep 19, 2026 18:052,73731,239,53621,433,0001,016,00020,480
5Sep 19, 2026 18:052,73931,318,07821,439,0001,028,00020,480
6Sep 19, 2026 18:052,75431,978,12921,539,0001,044,00020,480
7Sep 19, 2026 18:0517,847155,026,332145,350,0001,002,00020,480
8Sep 19, 2026 18:0517,975156,867,397146,346,0001,054,00020,480
9Sep 19, 2026 18:0518,540161,526,783151,019,0001,016,00020,480