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 10:01Victor MerckléVictor MerckléScore: 2,773Success
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 10:022,73230,598,70721,290,0001,119,0002,117,632stderr
2Sep 1, 2026 10:022,75130,668,25921,501,0001,064,0002,117,632stderr
3Sep 1, 2026 10:022,76631,729,50521,618,0001,064,0002,117,632stderr
4Sep 1, 2026 10:022,77031,085,58421,660,0001,056,0002,117,632stderr
5Sep 1, 2026 10:022,77331,746,04121,518,0001,228,0002,117,632stderr
6Sep 1, 2026 10:025,40052,644,59843,266,0001,015,0002,117,632stderr
7Sep 1, 2026 10:025,40852,480,81443,330,0001,016,0002,117,632stderr
8Sep 1, 2026 10:025,41852,672,57343,420,0001,015,0002,117,632stderr
9Sep 1, 2026 10:025,43452,758,60943,536,0001,028,0002,117,632stderr