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 28, 2026 05:28Dominique GarmierDominique GarmierScore: 13,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 05:2813,130133,519,817105,676,0001,993,0002,416,640
2Mar 28, 2026 05:2813,177129,639,916104,047,0004,001,0002,297,856
3Mar 28, 2026 05:2813,201136,667,254104,238,0004,009,0002,502,656