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:06Karthik ReddyKarthik ReddyScore: 2,712Success
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:072,50129,501,90219,508,0001,004,00020,480
2Oct 3, 2026 01:072,52129,714,87919,542,0001,133,00020,480
3Oct 3, 2026 01:072,52429,809,17919,577,0001,124,00020,480
4Oct 3, 2026 01:072,70931,287,20820,318,0001,900,00020,480
5Oct 3, 2026 01:072,71231,312,62420,328,0001,917,00020,480
6Oct 3, 2026 01:072,74031,430,46820,360,0002,108,00020,480
7Oct 3, 2026 01:072,76831,761,14520,475,0002,228,00020,480
8Oct 3, 2026 01:072,76931,835,52820,434,0002,279,00020,480
9Oct 3, 2026 01:072,84932,327,26919,641,0003,728,00020,480