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 14:50Victor MerckléVictor MerckléScore: 5,379Success
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 14:512,72030,600,26021,248,0001,060,0002,117,632stderr
2Aug 19, 2026 14:512,74530,777,42121,379,0001,134,0002,117,632stderr
3Aug 19, 2026 14:512,75730,953,58321,458,0001,151,0002,117,632stderr
4Aug 19, 2026 14:512,76531,691,45321,522,0001,159,0002,117,632stderr
5Aug 19, 2026 14:515,37952,397,86243,033,0001,081,0002,117,632stderr
6Aug 19, 2026 14:515,43552,937,42843,419,0001,149,0002,117,632stderr
7Aug 19, 2026 14:515,47353,207,08243,693,0001,190,0002,117,632stderr
8Aug 19, 2026 14:515,49555,120,57843,864,0001,195,0002,117,632stderr
9Aug 19, 2026 14:516,29859,749,19049,533,0002,112,0002,117,632stderr