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 28, 2026 11:10Dominique GarmierDominique GarmierScore: 13,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 11:1013,465136,629,450107,406,0003,011,0002,420,736
2Mar 28, 2026 11:1013,532129,295,875110,966,00002,371,584
3Mar 28, 2026 11:1013,564143,236,849108,218,0003,006,0002,523,136