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 23:22Dominique GarmierDominique GarmierScore: 13,575Success
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 23:2213,509138,988,115109,773,000997,0002,527,232
2Mar 21, 2026 23:2213,575142,621,836108,311,0003,008,0002,416,640
3Mar 21, 2026 23:2213,576144,813,275108,314,0003,008,0002,498,560