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 23, 2026 16:28Dominique GarmierDominique GarmierScore: 19,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 16:2818,899181,254,51265,987,00088,983,0002,519,040
2Mar 23, 2026 16:2819,046181,000,38867,077,00089,103,0002,473,984
3Mar 23, 2026 16:2819,135186,686,00671,959,00084,952,0002,510,848