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 11, 2026 05:25Victor MerckléVictor MerckléScore: 3,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 05:273,50938,699,29826,652,0002,125,0002,138,112
2Jun 11, 2026 05:273,52039,135,14426,592,0002,273,0002,138,112
3Jun 11, 2026 05:273,52738,879,80326,649,0002,274,0002,138,112
4Jun 11, 2026 05:273,52738,290,24426,707,0002,218,0002,138,112
5Jun 11, 2026 05:273,53138,341,10926,705,0002,250,0002,138,112
6Jun 11, 2026 05:273,59139,357,05127,234,0002,215,0002,138,112
7Jun 11, 2026 05:273,60039,677,83127,049,0002,472,0002,138,112
8Jun 11, 2026 05:2713,539121,218,084107,602,0003,422,0002,138,112
9Jun 11, 2026 05:2713,708122,683,746109,369,0003,043,0002,138,112