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 listNov 4, 2025 21:27AntonAntonScore: 52,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 21:2751,855452,155,136254,529,000170,684,0002,314,240
2Nov 4, 2025 21:2752,513453,595,326258,762,000171,842,0002,383,872
3Nov 4, 2025 21:2752,868460,628,549261,711,000171,810,0002,490,368