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 19, 2026 23:47olliecrowolliecrowScore: 18,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 23:473,41956,888,45126,036,0002,002,0002,289,664
2Mar 19, 2026 23:4718,392177,611,757147,817,0002,996,0002,371,584
3Mar 19, 2026 23:4718,412178,783,462149,980,000999,0002,392,064