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:31Karthik ReddyKarthik ReddyScore: 2,631Success
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:322,54829,914,76819,876,0001,020,00020,480
2Oct 3, 2026 01:322,55129,933,64619,902,0001,022,00020,480
3Oct 3, 2026 01:322,59030,208,40920,054,0001,191,00020,480
4Oct 3, 2026 01:322,61530,457,28820,152,0001,295,00020,480
5Oct 3, 2026 01:322,63130,655,72920,181,0001,398,00020,480
6Oct 3, 2026 01:322,65031,981,03619,497,0002,239,00020,480
7Oct 3, 2026 01:322,74231,599,46620,426,0002,066,00020,480
8Oct 3, 2026 01:322,82732,199,32219,593,0003,590,00020,480
9Oct 3, 2026 01:322,83032,213,40619,587,0003,627,00020,480