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 listJul 7, 2026 07:35Victor MerckléVictor MerckléScore: 2,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 07:362,91331,682,00022,874,0001,016,0002,117,632stderr
2Jul 7, 2026 07:362,91531,488,89422,872,0001,033,0002,117,632stderr
3Jul 7, 2026 07:362,92433,218,49522,966,0001,017,0002,117,632stderr
4Jul 7, 2026 07:362,92931,810,84722,991,0001,034,0002,117,632stderr
5Jul 7, 2026 07:362,98732,300,55423,321,0001,178,0002,117,632stderr
6Jul 7, 2026 07:363,19233,967,40225,156,0001,021,0002,117,632stderr
7Jul 7, 2026 07:3611,715103,687,57894,952,0001,119,0002,117,632stderr
8Jul 7, 2026 07:3611,770104,133,24495,436,0001,080,0002,117,632stderr
9Jul 7, 2026 07:3611,947105,709,86496,743,0001,228,0002,117,632stderr