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 9, 2026 18:41Victor MerckléVictor MerckléScore: 12,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 18:424,02341,493,27830,936,0002,059,0002,117,632stderr
2Jul 9, 2026 18:424,08941,547,55531,380,0002,156,0002,117,632stderr
3Jul 9, 2026 18:424,09042,077,76231,365,0002,173,0002,117,632stderr
4Jul 9, 2026 18:424,10341,734,56231,483,0002,167,0002,117,632stderr
5Jul 9, 2026 18:4212,880116,208,686103,607,0002,016,0002,117,632stderr
6Jul 9, 2026 18:4212,980114,480,627104,419,0002,021,0002,117,632stderr
7Jul 9, 2026 18:4213,003115,228,857104,612,0002,017,0002,117,632stderr
8Jul 9, 2026 18:4213,422118,100,085108,051,0002,017,0002,117,632stderr
9Jul 9, 2026 18:4213,499119,222,955108,679,0002,019,0002,117,632stderr