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 8, 2026 19:26Victor MerckléVictor MerckléScore: 2,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 19:272,55829,418,66420,976,000024,576stderr
2Sep 8, 2026 19:272,57129,535,95720,039,0001,049,00024,576stderr
3Sep 8, 2026 19:272,64430,141,73621,686,000024,576stderr
4Sep 8, 2026 19:272,64630,237,73121,698,000024,576stderr
5Sep 8, 2026 19:272,65830,925,08821,801,000024,576stderr
6Sep 8, 2026 19:272,67030,392,49120,896,0001,005,00024,576stderr
7Sep 8, 2026 19:275,47453,432,41543,873,0001,015,00024,576stderr
8Sep 8, 2026 19:275,48054,697,57043,929,0001,014,00024,576stderr
9Sep 8, 2026 19:275,49553,596,16344,047,0001,016,00024,576stderr