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 14, 2026 18:34marko1597marko1597Score: 3,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:403,67238,507,27029,084,0001,030,0002,121,728stderr
2Aug 14, 2026 18:403,70338,789,87829,340,0001,029,0002,121,728stderr
3Aug 14, 2026 18:403,74339,166,21129,675,0001,020,0002,121,728stderr
4Aug 14, 2026 18:403,79439,494,90730,071,0001,041,0002,121,728stderr
5Aug 14, 2026 18:403,80839,666,34330,191,0001,040,0002,121,728stderr
6Aug 14, 2026 18:403,88140,243,67530,784,0001,044,0002,121,728stderr
7Aug 14, 2026 18:403,90140,414,36030,953,0001,043,0002,121,728stderr
8Aug 14, 2026 18:403,90340,477,55430,986,0001,023,0002,121,728stderr
9Aug 14, 2026 18:403,92040,575,25031,102,0001,050,0002,121,728stderr