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 13, 2026 15:33Dominique GarmierDominique GarmierScore: 41,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:3340,832362,165,010330,824,0003,997,0002,269,184
2Mar 13, 2026 15:3341,107367,644,321333,077,0004,000,0002,265,088
3Mar 13, 2026 15:3341,208368,375,859333,911,0003,998,0002,273,280