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:08Victor MerckléVictor MerckléScore: 5,523Success
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:132,88331,776,80622,403,0001,242,0002,117,632stderr
2Aug 19, 2026 14:132,89531,931,66422,524,0001,215,0002,117,632stderr
3Aug 19, 2026 14:132,96833,718,49523,116,0001,224,0002,117,632stderr
4Aug 19, 2026 14:135,45953,097,29743,649,0001,120,0002,117,632stderr
5Aug 19, 2026 14:135,52353,678,17444,255,0001,037,0002,117,632stderr
6Aug 19, 2026 14:135,54354,490,89944,429,0001,028,0002,117,632stderr
7Aug 19, 2026 14:135,58053,895,34344,717,0001,045,0002,117,632stderr
8Aug 19, 2026 14:135,61956,380,96245,061,0001,021,0002,117,632stderr
9Aug 19, 2026 14:135,64555,375,96245,276,0001,019,0002,117,632stderr