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 2, 2026 22:54Karthik ReddyKarthik ReddyScore: 3,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 22:563,0446,040,060,15623,917,0001,048,00020,480
2Oct 2, 2026 22:563,0536,034,169,26124,011,0001,024,00020,480
3Oct 2, 2026 22:563,0626,034,310,63724,045,0001,064,00020,480
4Oct 2, 2026 22:563,1206,034,846,28624,521,0001,064,00020,480
5Oct 2, 2026 22:563,1236,034,793,82924,558,0001,054,00020,480
6Oct 2, 2026 22:563,1616,035,250,69324,854,0001,072,00020,480
7Oct 2, 2026 22:564,1646,043,417,90034,149,000020,480
8Oct 2, 2026 22:566,2876,060,847,74950,510,0001,051,00020,480
9Oct 2, 2026 22:5630,0476,255,750,791245,291,0001,102,00020,480