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 24, 2026 09:40Dominique GarmierDominique GarmierScore: 99,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 09:4071,792613,706,187455,764,000132,931,0002,273,280
2Mar 24, 2026 09:4099,601846,886,498680,771,000135,954,0002,473,984
3Mar 24, 2026 09:40108,831923,818,165753,352,000139,065,0002,297,856