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 19, 2026 13:27Andrew EpsteinAndrew EpsteinScore: 6,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:355,96260,306,02942,801,0006,089,0002,129,920stderr
2Sep 19, 2026 13:355,99059,217,29443,032,0006,093,0002,129,920stderr
3Sep 19, 2026 13:356,01559,482,23543,235,0006,088,0002,129,920stderr
4Sep 19, 2026 13:356,04859,666,28543,500,0006,094,0002,129,920stderr
5Sep 19, 2026 13:356,09860,304,53543,901,0006,105,0002,129,920stderr
6Sep 19, 2026 13:356,10460,177,73643,940,0006,118,0002,125,824stderr
7Sep 19, 2026 13:356,11561,528,28144,043,0006,103,0002,129,920stderr
8Sep 19, 2026 13:356,13060,526,52744,172,0006,100,0002,129,920stderr
9Sep 19, 2026 13:356,17060,843,32144,494,0006,104,0002,129,920stderr