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 04:06Dominique GarmierDominique GarmierScore: 16,475Success
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 04:0616,438160,340,034132,792,0001,996,0002,494,464
2Mar 24, 2026 04:0616,475163,801,540134,091,0001,000,0002,359,296
3Mar 24, 2026 04:0616,544164,036,124132,665,0002,992,0002,404,352