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:32Karthik ReddyKarthik ReddyScore: 2,542Success
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:012,53729,764,84620,804,000020,480
2Oct 9, 2026 14:012,53729,680,84920,807,000020,480
3Oct 9, 2026 14:012,53829,705,62620,819,000020,480
4Oct 9, 2026 14:012,53829,717,01220,816,000020,480
5Oct 9, 2026 14:012,54230,407,86920,849,000020,480
6Oct 9, 2026 14:012,54529,897,60020,872,000020,480
7Oct 9, 2026 14:012,54629,930,15620,878,000020,480
8Oct 9, 2026 14:012,54629,871,16620,881,000020,480
9Oct 9, 2026 14:012,54929,838,73020,908,000020,480