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 12, 2026 10:19Victor MerckléVictor MerckléScore: 3,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 10:203,37936,851,65125,664,0002,048,0002,113,536
2Jun 12, 2026 10:203,40036,980,05726,846,0001,039,0002,113,536
3Jun 12, 2026 10:203,41937,145,17825,941,0002,097,0002,113,536
4Jun 12, 2026 10:203,43037,310,10526,047,0002,085,0002,113,536
5Jun 12, 2026 10:203,43137,322,56126,113,0002,024,0002,113,536
6Jun 12, 2026 10:203,46237,448,77626,252,0002,138,0002,113,536
7Jun 12, 2026 10:203,46337,548,20026,366,0002,034,0002,113,536
8Jun 12, 2026 10:203,52538,004,39026,707,0002,204,0002,113,536
9Jun 12, 2026 10:207,67972,023,29260,948,0002,022,0002,113,536