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 29, 2026 00:14Dominique GarmierDominique GarmierScore: 16,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 00:1416,422158,798,572131,671,0002,992,0002,293,760
2Mar 29, 2026 00:1416,672165,105,317134,713,0001,995,0002,433,024
3Mar 29, 2026 00:1416,678166,645,635132,765,0003,992,0002,428,928