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 09:07Kevin HeaveyKevin HeaveyScore: 2,520Success
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 09:102,50729,258,20519,545,0001,018,00020,480
2Sep 24, 2026 09:102,51230,046,58419,598,0001,003,00020,480
3Sep 24, 2026 09:102,51629,284,32619,626,0001,007,00020,480
4Sep 24, 2026 09:102,51729,509,11619,631,0001,016,00020,480
5Sep 24, 2026 09:102,52030,046,01119,665,0001,005,00020,480
6Sep 24, 2026 09:102,98833,940,45119,708,0004,801,00020,480
7Sep 24, 2026 09:103,21035,645,04019,978,0006,348,00020,480
8Sep 24, 2026 09:104,07342,134,85820,242,00013,160,00020,480
9Sep 24, 2026 09:106,21059,630,77548,893,0002,037,00020,480