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 11:29Victor MerckléVictor MerckléScore: 11,672Success
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 11:302,83331,212,06322,209,0001,028,0002,117,632stderr
2Jul 7, 2026 11:303,01832,819,43023,547,0001,205,0002,117,632stderr
3Jul 7, 2026 11:3011,601103,126,50494,087,0001,043,0002,117,632stderr
4Jul 7, 2026 11:3011,665103,588,45394,526,0001,132,0002,117,632stderr
5Jul 7, 2026 11:3011,672103,714,11394,581,0001,135,0002,117,632stderr
6Jul 7, 2026 11:3011,711104,489,94394,882,0001,153,0002,117,632stderr
7Jul 7, 2026 11:3012,191107,991,19098,774,0001,194,0002,117,632stderr
8Jul 7, 2026 11:3012,221108,302,92399,019,0001,201,0002,117,632stderr
9Jul 7, 2026 11:3012,263108,500,98399,444,0001,113,0002,117,632stderr