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 14:57Dominique GarmierDominique GarmierScore: 13,066Success
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 14:5712,987134,490,092103,480,0003,013,0002,387,968
2Mar 24, 2026 14:5713,066138,613,967106,140,0001,001,0002,355,200
3Mar 24, 2026 14:5713,067135,990,815105,150,0002,002,0002,318,336