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 29, 2026 13:37Victor MerckléVictor MerckléScore: 2,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:382,78131,115,41621,577,0001,229,0002,117,632stderr
2Aug 29, 2026 13:382,78931,193,55621,666,0001,206,0002,117,632stderr
3Aug 29, 2026 13:382,80431,426,84721,694,0001,305,0002,117,632stderr
4Aug 29, 2026 13:382,81031,368,07021,759,0001,283,0002,117,632stderr
5Aug 29, 2026 13:382,82031,466,68822,094,0001,034,0002,117,632stderr
6Aug 29, 2026 13:382,82131,458,26721,839,0001,295,0002,117,632stderr
7Aug 29, 2026 13:382,82931,539,13421,915,0001,286,0002,117,632stderr
8Aug 29, 2026 13:385,50153,196,43544,089,0001,023,0002,117,632stderr
9Aug 29, 2026 13:385,52253,375,29444,260,0001,023,0002,117,632stderr