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 11:34Dominique GarmierDominique GarmierScore: 22,446Success
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 11:3421,714205,165,112161,050,00017,005,0002,334,720
2Mar 24, 2026 11:3422,446217,327,675172,051,00012,003,0002,453,504
3Mar 24, 2026 11:3424,595229,444,446182,708,00018,969,0002,433,024