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 listOct 3, 2026 01:33Karthik ReddyKarthik ReddyScore: 2,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:342,48229,387,29120,354,000020,480
2Oct 3, 2026 01:342,53229,934,60919,740,0001,025,00020,480
3Oct 3, 2026 01:342,58530,215,72020,021,0001,184,00020,480
4Oct 3, 2026 01:342,60430,419,70320,092,0001,268,00020,480
5Oct 3, 2026 01:342,67531,070,60620,271,0001,666,00020,480
6Oct 3, 2026 01:342,69531,098,12520,363,0001,744,00020,480
7Oct 3, 2026 01:342,74231,516,33120,383,0002,103,00020,480
8Oct 3, 2026 01:342,77031,761,47219,569,0003,145,00020,480
9Oct 3, 2026 01:342,82932,255,81919,625,0003,575,00020,480