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 08:09Victor MerckléVictor MerckléScore: 2,597Success
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 08:102,58130,701,44121,170,000024,576stderr
2Sep 8, 2026 08:102,58629,550,26021,213,000024,576stderr
3Sep 8, 2026 08:102,59329,653,05421,264,000024,576stderr
4Sep 8, 2026 08:102,59429,626,32721,276,000024,576stderr
5Sep 8, 2026 08:102,59730,411,09821,298,000024,576stderr
6Sep 8, 2026 08:105,33352,809,48242,720,0001,015,00024,576stderr
7Sep 8, 2026 08:105,35652,095,43742,908,0001,015,00024,576stderr
8Sep 8, 2026 08:105,36553,097,92842,977,0001,017,00024,576stderr
9Sep 8, 2026 08:1010,11091,146,63981,893,0001,016,00024,576stderr