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 12:22Victor MerckléVictor MerckléScore: 2,770Success
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 12:252,74230,639,52221,480,0001,010,0002,117,632stderr
2Aug 29, 2026 12:252,74730,838,41021,441,0001,089,0002,117,632stderr
3Aug 29, 2026 12:252,76531,018,81321,590,0001,085,0002,117,632stderr
4Aug 29, 2026 12:252,76531,322,52921,507,0001,172,0002,117,632stderr
5Aug 29, 2026 12:252,77030,873,46121,682,0001,033,0002,117,632stderr
6Aug 29, 2026 12:252,77731,101,12421,751,0001,021,0002,117,632stderr
7Aug 29, 2026 12:252,78035,748,72421,779,0001,024,0002,117,632stderr
8Aug 29, 2026 12:255,42152,843,78943,414,0001,043,0002,117,632stderr
9Aug 29, 2026 12:255,47052,990,46743,798,0001,062,0002,117,632stderr