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 17:51Dominique GarmierDominique GarmierScore: 14,244Success
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 17:5114,062141,840,126113,304,0002,005,0002,375,680
2Mar 24, 2026 17:5114,244142,669,119114,808,0001,996,0002,523,136
3Mar 24, 2026 17:5114,268143,340,596113,995,0002,999,0002,420,736