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 listAug 19, 2026 09:03Victor MerckléVictor MerckléScore: 2,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 09:042,83332,895,58622,098,0001,136,0002,117,632stderr
2Aug 19, 2026 09:042,84431,465,55722,307,0001,015,0002,117,632stderr
3Aug 19, 2026 09:042,86131,678,02022,433,0001,028,0002,117,632stderr
4Aug 19, 2026 09:042,88831,917,24422,572,0001,114,0002,117,632stderr
5Aug 19, 2026 09:042,91032,002,33822,837,0001,031,0002,117,632stderr
6Aug 19, 2026 09:042,97132,675,92323,339,0001,031,0002,117,632stderr
7Aug 19, 2026 09:045,47553,992,29943,762,0001,138,0002,117,632stderr
8Aug 19, 2026 09:045,48153,157,00043,808,0001,137,0002,117,632stderr
9Aug 19, 2026 09:045,56753,873,09344,640,0001,014,0002,117,632stderr