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 31, 2026 12:20Victor MerckléVictor MerckléScore: 2,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:252,77532,775,11021,629,0001,133,0002,117,632stderr
2Aug 31, 2026 12:252,77931,190,51221,597,0001,198,0002,117,632stderr
3Aug 31, 2026 12:252,78031,852,20821,607,0001,197,0002,117,632stderr
4Aug 31, 2026 12:252,78231,150,81521,607,0001,206,0002,117,632stderr
5Aug 31, 2026 12:252,79031,182,74421,685,0001,199,0002,117,632stderr
6Aug 31, 2026 12:252,80231,351,29921,877,0001,105,0002,117,632stderr
7Aug 31, 2026 12:255,42553,518,38443,409,0001,077,0002,117,632stderr
8Aug 31, 2026 12:255,43253,594,11043,534,0001,016,0002,117,632stderr
9Aug 31, 2026 12:255,44653,621,74643,584,0001,075,0002,117,632stderr