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 21, 2026 22:12Dominique GarmierDominique GarmierScore: 12,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 22:1212,926133,251,371102,997,0002,999,0002,416,640
2Mar 21, 2026 22:1212,930132,088,618104,025,0002,000,0002,400,256
3Mar 21, 2026 22:1213,025132,805,978105,804,000998,0002,433,024