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 listJun 8, 2026 16:15Victor MerckléVictor MerckléScore: 6,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 16:163,26235,838,87925,470,0001,280,0002,113,536
2Jun 8, 2026 16:163,26735,934,45925,524,0001,269,0002,113,536
3Jun 8, 2026 16:163,30636,218,32226,095,0001,021,0002,113,536
4Jun 8, 2026 16:163,34836,623,92326,427,0001,032,0002,113,536
5Jun 8, 2026 16:166,31460,906,82449,670,0002,106,0002,113,536
6Jun 8, 2026 16:166,32360,987,07049,712,0002,138,0002,113,536
7Jun 8, 2026 16:166,40161,759,71150,341,0002,154,0002,113,536
8Jun 8, 2026 16:166,42061,689,19050,386,0002,265,0002,113,536
9Jun 8, 2026 16:1616,568146,311,832132,802,0003,058,0002,113,536