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 30, 2026 12:27Dominique GarmierDominique GarmierScore: 17,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 12:2717,242164,405,506141,388,00002,289,664
2Mar 30, 2026 12:2717,249177,859,086140,441,0001,003,0002,322,432
3Mar 30, 2026 12:2717,282170,357,083139,718,0001,995,0002,322,432