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 9, 2026 14:28Karthik ReddyKarthik ReddyScore: 2,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 14:482,53329,514,64920,776,000020,480
2Oct 9, 2026 14:482,53329,377,09720,772,000020,480
3Oct 9, 2026 14:482,53429,552,93120,786,000020,480
4Oct 9, 2026 14:482,53529,463,04520,793,000020,480
5Oct 9, 2026 14:482,53629,261,81420,800,000020,480
6Oct 9, 2026 14:482,53729,407,00720,808,000020,480
7Oct 9, 2026 14:482,54029,564,79620,828,000020,480
8Oct 9, 2026 14:482,54129,514,30620,838,000020,480
9Oct 9, 2026 14:482,55129,610,83119,879,0001,043,00020,480