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 19:20Dominique GarmierDominique GarmierScore: 12,033Success
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 19:2011,959130,369,17995,060,0003,001,0002,342,912
2Mar 24, 2026 19:2012,033128,581,18795,679,0002,989,0002,498,560
3Mar 24, 2026 19:2012,033127,456,10696,680,0001,993,0002,297,856