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 listMar 4, 2026 22:38olliecrowolliecrowScore: 12,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 22:3812,603125,836,721101,336,0002,006,0002,424,832
2Mar 4, 2026 22:3812,646129,981,716101,705,0001,994,0002,457,600
3Mar 4, 2026 22:3812,726132,799,107103,354,0001,003,0002,412,544