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 08:50Karthik ReddyKarthik ReddyScore: 2,541Success
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 09:572,52829,390,48320,733,000020,480
2Oct 9, 2026 09:572,53129,441,71620,762,000020,480
3Oct 9, 2026 09:572,53429,345,43720,785,000020,480
4Oct 9, 2026 09:572,53929,537,48120,826,000020,480
5Oct 9, 2026 09:572,54129,445,36020,841,000020,480
6Oct 9, 2026 09:572,54129,575,99720,837,000020,480
7Oct 9, 2026 09:572,54329,522,50920,855,000020,480
8Oct 9, 2026 09:572,54629,619,98120,880,000020,480
9Oct 9, 2026 09:572,55629,715,00119,945,0001,016,00020,480