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 listApr 16, 2026 00:47olliecrowolliecrowScore: 13,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 00:4713,175137,745,484105,035,0003,001,0002,338,816
2Apr 16, 2026 00:4713,213136,847,574106,344,0002,006,0002,379,776
3Apr 16, 2026 00:4721,588209,388,699172,020,0005,000,0002,347,008