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 23, 2026 03:46Dominique GarmierDominique GarmierScore: 26,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 03:4626,469243,468,950215,044,0002,000,0002,473,984
2Mar 23, 2026 03:4626,653248,073,711218,553,00002,510,848
3Mar 23, 2026 03:4626,833243,362,423218,028,0002,000,0002,519,040