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 listApr 30, 2026 08:20Victor MerckléVictor MerckléScore: 36,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 08:2135,209309,284,193284,724,0003,996,0002,383,872
2Apr 30, 2026 08:2135,586310,421,608289,809,0001,998,0002,416,640
3Apr 30, 2026 08:2135,774311,177,359292,348,0001,001,0002,355,200
4Apr 30, 2026 08:2135,791311,787,274290,488,0003,005,0002,482,176
5Apr 30, 2026 08:2136,040312,228,673292,541,0002,995,0002,433,024
6Apr 30, 2026 08:2136,346314,564,142295,043,0003,000,0002,404,352
7Apr 30, 2026 08:2136,420318,518,606295,654,0002,996,0002,383,872
8Apr 30, 2026 08:2136,673317,841,351298,728,0001,998,0002,428,928
9Apr 30, 2026 08:2137,138317,362,726298,546,0005,990,0002,404,352