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 1, 2026 11:29Victor MerckléVictor MerckléScore: 2,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 11:302,71730,587,53721,232,0001,054,0002,117,632stderr
2Sep 1, 2026 11:302,71830,670,42421,159,0001,134,0002,117,632stderr
3Sep 1, 2026 11:302,72630,636,56921,234,0001,123,0002,117,632stderr
4Sep 1, 2026 11:302,72830,810,15321,267,0001,108,0002,117,632stderr
5Sep 1, 2026 11:302,73430,915,25021,312,0001,109,0002,117,632stderr
6Sep 1, 2026 11:302,73630,797,37021,427,0001,013,0002,117,632stderr
7Sep 1, 2026 11:305,35852,068,28842,925,0001,013,0002,117,632stderr
8Sep 1, 2026 11:305,39453,304,18543,214,0001,017,0002,117,632stderr
9Sep 1, 2026 11:305,46053,186,98643,750,0001,025,0002,117,632stderr