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 12, 2026 07:45Haha ExpertHaha ExpertScore: 54,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 07:4653,644448,761,254302,052,000137,831,0002,117,632
2Sep 12, 2026 07:4654,171452,827,957305,451,000138,759,0002,117,632
3Sep 12, 2026 07:4654,224453,978,563308,173,000136,464,0002,117,632
4Sep 12, 2026 07:4654,386454,913,761310,034,000135,935,0002,117,632
5Sep 12, 2026 07:4654,410455,601,096309,564,000136,600,0002,117,632
6Sep 12, 2026 07:4654,595457,214,318310,617,000137,070,0002,117,632
7Sep 12, 2026 07:4654,782459,891,567309,573,000139,647,0002,117,632
8Sep 12, 2026 07:4655,011459,913,107312,030,000139,067,0002,117,632
9Sep 12, 2026 07:4655,664465,734,386319,541,000136,910,0002,117,632