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 07:32Victor MerckléVictor MerckléScore: 5,333Success
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 07:352,58829,592,28821,226,000024,576stderr
2Sep 8, 2026 07:352,59229,562,10121,255,000024,576stderr
3Sep 8, 2026 07:352,59430,416,45521,276,000024,576stderr
4Sep 8, 2026 07:352,61929,759,02520,434,0001,048,00024,576stderr
5Sep 8, 2026 07:355,33352,086,76942,717,0001,016,00024,576stderr
6Sep 8, 2026 07:355,52253,548,71342,663,0002,621,00024,576stderr
7Sep 8, 2026 07:356,53564,114,37121,715,00031,874,00024,576stderr
8Sep 8, 2026 07:356,71563,388,36222,232,00032,837,00024,576stderr
9Sep 8, 2026 07:359,32585,480,86944,280,00032,186,00016,801,792stderr