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 22, 2026 12:44Dominique GarmierDominique GarmierScore: 13,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 12:4413,047137,862,655104,988,0001,999,0002,490,368
2Mar 22, 2026 12:4413,182132,150,477106,095,0002,001,0002,502,656
3Mar 22, 2026 12:4413,296135,745,096106,029,0003,000,0002,437,120