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 2, 2026 14:44Victor MerckléVictor MerckléScore: 11,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:453,00532,535,90123,631,0001,016,0002,117,632stderr
2Jul 2, 2026 14:453,00732,517,79323,641,0001,017,0002,117,632stderr
3Jul 2, 2026 14:453,01232,747,84223,656,0001,050,0002,117,632stderr
4Jul 2, 2026 14:453,01832,886,95823,724,0001,024,0002,117,632stderr
5Jul 2, 2026 14:4511,860105,126,61496,203,0001,051,0002,117,632stderr
6Jul 2, 2026 14:4511,886105,344,89496,352,0001,120,0002,117,632stderr
7Jul 2, 2026 14:4511,916105,562,01796,586,0001,127,0002,117,632stderr
8Jul 2, 2026 14:4511,919105,722,09396,570,0001,169,0002,117,632stderr
9Jul 2, 2026 14:4512,508110,440,999101,461,0001,107,0002,117,632stderr