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 20, 2026 16:18BenBenScore: 34,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:2133,821307,492,399104,750,000172,588,0002,469,888
2Apr 20, 2026 16:2134,502304,471,697105,344,000177,580,0002,273,280
3Apr 20, 2026 16:2134,711308,513,725103,866,000180,767,0002,453,504