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 09:24Victor MerckléVictor MerckléScore: 5,465Success
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 09:252,80731,272,14821,857,0001,161,0002,117,632stderr
2Aug 29, 2026 09:252,81231,473,35321,788,0001,271,0002,117,632stderr
3Aug 29, 2026 09:252,81631,510,64921,869,0001,230,0002,117,632stderr
4Aug 29, 2026 09:252,81731,446,20121,897,0001,210,0002,117,632stderr
5Aug 29, 2026 09:255,46553,173,56843,781,0001,034,0002,117,632stderr
6Aug 29, 2026 09:255,48353,284,10143,942,0001,019,0002,117,632stderr
7Aug 29, 2026 09:255,49153,362,99744,001,0001,028,0002,117,632stderr
8Aug 29, 2026 09:255,51154,086,35244,172,0001,019,0002,117,632stderr
9Aug 29, 2026 09:255,53453,770,52744,363,0001,023,0002,117,632stderr