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 23, 2026 10:36Dominique GarmierDominique GarmierScore: 17,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 10:3614,380150,134,593114,920,0002,997,0002,490,368
2Mar 23, 2026 10:3617,478167,066,392138,307,0005,011,0002,297,856
3Mar 23, 2026 10:3617,738177,847,360143,445,0002,006,0002,494,464