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 19:19Dominique GarmierDominique GarmierScore: 30,569Success
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 19:1929,848271,934,818241,754,0002,996,0002,318,336
2Mar 22, 2026 19:1930,569278,624,147249,669,000998,0002,318,336
3Mar 22, 2026 19:1932,001290,834,060262,409,00002,322,432