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 listSep 1, 2026 14:24Victor MerckléVictor MerckléScore: 2,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 14:252,62729,520,85020,536,0001,012,0002,117,632stderr
2Sep 1, 2026 14:252,62929,595,55120,544,0001,015,0002,117,632stderr
3Sep 1, 2026 14:252,63029,592,75420,556,0001,018,0002,117,632stderr
4Sep 1, 2026 14:252,63129,618,06320,561,0001,018,0002,117,632stderr
5Sep 1, 2026 14:252,63529,738,03020,590,0001,023,0002,117,632stderr
6Sep 1, 2026 14:252,64029,759,61020,627,0001,029,0002,117,632stderr
7Sep 1, 2026 14:255,35651,926,50242,884,0001,036,0002,117,632stderr
8Sep 1, 2026 14:255,39352,274,08343,189,0001,039,0002,117,632stderr
9Sep 1, 2026 14:255,39452,312,51843,211,0001,023,0002,117,632stderr