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 24, 2026 08:42Kevin HeaveyKevin HeaveyScore: 2,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 08:462,51930,031,58520,656,000020,480
2Sep 24, 2026 08:462,52429,335,79220,704,000020,480
3Sep 24, 2026 08:462,52730,137,68720,724,000020,480
4Sep 24, 2026 08:462,52729,424,26919,723,0001,005,00020,480
5Sep 24, 2026 08:462,53130,150,43120,758,000020,480
6Sep 24, 2026 08:462,54430,229,95920,864,000020,480
7Sep 24, 2026 08:467,62371,141,62460,226,0002,284,00020,480
8Sep 24, 2026 08:467,73672,102,68261,427,0002,014,00020,480
9Sep 24, 2026 08:467,90473,526,67362,800,0002,015,00020,480