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:25Victor MerckléVictor MerckléScore: 2,593Success
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:262,58429,601,18721,194,000024,576stderr
2Sep 8, 2026 07:262,58829,683,57821,226,000024,576stderr
3Sep 8, 2026 07:262,59129,503,33021,251,000024,576stderr
4Sep 8, 2026 07:262,59229,524,24221,256,000024,576stderr
5Sep 8, 2026 07:262,59329,693,15721,269,000024,576stderr
6Sep 8, 2026 07:262,59429,709,69521,276,000024,576stderr
7Sep 8, 2026 07:262,59729,728,00521,302,000024,576stderr
8Sep 8, 2026 07:262,59929,696,78621,314,000024,576stderr
9Sep 8, 2026 07:265,33352,073,97042,722,0001,014,00024,576stderr