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 listJun 6, 2026 01:08Victor MerckléVictor MerckléScore: 4,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 01:093,38136,850,75126,693,0001,037,0002,113,536
2Jun 6, 2026 01:093,38636,900,38626,690,0001,076,0002,113,536
3Jun 6, 2026 01:093,40737,107,69126,872,0001,069,0002,113,536
4Jun 6, 2026 01:093,45637,481,32626,305,0002,040,0002,113,536
5Jun 6, 2026 01:094,18043,375,83632,070,0002,208,0002,113,536
6Jun 6, 2026 01:094,18843,563,76132,236,0002,111,0002,113,536
7Jun 6, 2026 01:094,21244,103,32032,402,0002,138,0002,113,536
8Jun 6, 2026 01:0912,940115,308,717104,088,0002,028,0002,113,536
9Jun 6, 2026 01:0913,475119,603,574108,477,0002,025,0002,113,536