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:16Karthik ReddyKarthik ReddyScore: 2,658Success
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:172,48029,427,59520,342,000020,480
2Oct 3, 2026 01:172,56029,945,22919,970,0001,023,00020,480
3Oct 3, 2026 01:172,57030,024,73419,915,0001,159,00020,480
4Oct 3, 2026 01:172,64530,768,21219,516,0002,177,00020,480
5Oct 3, 2026 01:172,65830,908,75420,183,0001,615,00020,480
6Oct 3, 2026 01:172,76231,718,62119,557,0003,094,00020,480
7Oct 3, 2026 01:172,97033,430,12019,637,0004,723,00020,480
8Oct 3, 2026 01:175,01450,105,35939,407,0001,709,00020,480
9Oct 3, 2026 01:175,05450,520,98338,451,0002,999,00020,480