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 20, 2026 00:47Dominique GarmierDominique GarmierScore: 41,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 00:4739,987354,453,681325,895,0001,999,0002,260,992
2Mar 20, 2026 00:4741,005364,592,587333,240,0003,002,0002,269,184
3Mar 20, 2026 00:4741,206367,542,439335,889,0001,999,0002,289,664