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 20:33Dominique GarmierDominique GarmierScore: 10,257Success
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 20:3310,249109,542,21783,039,0001,000,0002,383,872
2Mar 23, 2026 20:3310,257113,855,29482,104,0002,002,0002,400,256
3Mar 23, 2026 20:3310,329112,406,89379,718,0004,982,0002,441,216