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 19, 2026 03:37Dominique GarmierDominique GarmierScore: 13,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 03:3713,989144,214,683111,716,0002,992,0002,514,944
2Mar 19, 2026 03:3713,997140,780,186113,781,000998,0002,531,328
3Mar 19, 2026 03:3714,010145,393,666112,884,0001,997,0002,486,272