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 12:56Victor MerckléVictor MerckléScore: 2,645Success
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 12:582,55129,362,15720,924,000024,576stderr
2Sep 8, 2026 12:582,56329,281,59321,018,000024,576stderr
3Sep 8, 2026 12:582,61929,772,84421,481,000024,576stderr
4Sep 8, 2026 12:582,63030,631,94621,570,000024,576stderr
5Sep 8, 2026 12:582,64530,030,86821,691,000024,576stderr
6Sep 8, 2026 12:582,64530,109,72921,697,000024,576stderr
7Sep 8, 2026 12:585,40952,654,64643,341,0001,013,00024,576stderr
8Sep 8, 2026 12:585,45053,810,76843,678,0001,013,00024,576stderr
9Sep 8, 2026 12:585,48853,183,82943,992,0001,014,00024,576stderr