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 13:31Karthik ReddyKarthik ReddyScore: 2,538Success
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 13:592,52829,355,42920,735,000020,480
2Oct 9, 2026 13:592,53029,536,49620,750,000020,480
3Oct 9, 2026 13:592,53329,506,43420,776,000020,480
4Oct 9, 2026 13:592,53529,557,15620,789,000020,480
5Oct 9, 2026 13:592,53829,648,62820,813,000020,480
6Oct 9, 2026 13:592,53829,638,96420,816,000020,480
7Oct 9, 2026 13:592,54029,446,77520,832,000020,480
8Oct 9, 2026 13:592,54229,534,68220,851,000020,480
9Oct 9, 2026 13:592,57429,888,08520,083,0001,031,00020,480