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 20, 2026 04:00olliecrowolliecrowScore: 3,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 04:003,54153,964,57227,037,0002,002,0002,347,008
2Mar 20, 2026 04:003,59955,754,49928,491,0001,017,0002,371,584
3Mar 20, 2026 04:003,61454,576,32328,615,0001,021,0002,412,544