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 23, 2026 14:01Victor MerckléVictor MerckléScore: 5,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 14:022,97132,737,60723,339,0001,025,0002,117,632stderr
2Aug 23, 2026 14:022,98632,821,76523,396,0001,094,0002,117,632stderr
3Aug 23, 2026 14:023,00333,632,99723,452,0001,173,0002,117,632stderr
4Aug 23, 2026 14:023,02933,144,71923,819,0001,023,0002,117,632stderr
5Aug 23, 2026 14:025,61354,469,39744,888,0001,143,0002,117,632stderr
6Aug 23, 2026 14:025,61555,701,95344,905,0001,141,0002,117,632stderr
7Aug 23, 2026 14:025,67254,802,12445,477,0001,035,0002,117,632stderr
8Aug 23, 2026 14:025,78355,778,90446,309,0001,115,0002,117,632stderr
9Aug 23, 2026 14:0214,906130,608,236121,224,0001,007,0002,117,632stderr