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 7, 2026 17:10Victor MerckléVictor MerckléScore: 2,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:112,64330,832,66721,678,000024,576stderr
2Sep 7, 2026 17:112,65030,157,59321,734,000024,576stderr
3Sep 7, 2026 17:112,65430,915,41421,768,000024,576stderr
4Sep 7, 2026 17:112,65430,924,34721,768,000024,576stderr
5Sep 7, 2026 17:112,65630,185,36321,782,000024,576stderr
6Sep 7, 2026 17:112,65930,261,10721,807,000024,576stderr
7Sep 7, 2026 17:112,71530,735,33622,268,000024,576stderr
8Sep 7, 2026 17:115,40552,758,23243,309,0001,014,00024,576stderr
9Sep 7, 2026 17:115,45053,131,40243,679,0001,015,00024,576stderr