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:29Karthik ReddyKarthik ReddyScore: 102,845Success
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:3096,555802,806,410700,655,00091,103,00020,480
2Oct 3, 2026 01:3098,098815,342,506715,825,00088,583,00020,480
3Oct 3, 2026 01:30100,987838,883,216733,412,00094,686,00020,480
4Oct 3, 2026 01:30102,799853,658,881753,161,00089,798,00020,480
5Oct 3, 2026 01:30102,845855,902,714754,107,00089,224,00020,480
6Oct 3, 2026 01:30106,382883,658,413779,103,00093,235,00020,480
7Oct 3, 2026 01:30112,891936,361,454835,195,00090,512,00020,480
8Oct 3, 2026 01:30113,107938,311,929833,776,00093,709,00020,480
9Oct 3, 2026 01:30130,2191,078,825,396976,734,00091,066,0002,113,536