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 10:55Victor MerckléVictor MerckléScore: 2,708Success
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 10:572,60529,621,97021,369,000024,576stderr
2Sep 8, 2026 10:572,67130,198,29021,907,000024,576stderr
3Sep 8, 2026 10:572,68130,287,73821,989,000024,576stderr
4Sep 8, 2026 10:572,69030,490,63422,064,000024,576stderr
5Sep 8, 2026 10:572,70831,350,00222,211,000024,576stderr
6Sep 8, 2026 10:575,42252,838,45043,448,0001,014,00024,576stderr
7Sep 8, 2026 10:575,43152,730,67843,529,0001,013,00024,576stderr
8Sep 8, 2026 10:575,54853,828,45344,488,0001,013,00024,576stderr
9Sep 8, 2026 10:5710,65296,594,00986,343,0001,010,00024,576stderr