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 listNov 10, 2025 02:17izotoffizotoffScore: 126,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 02:1780,384683,207,430493,363,000165,786,0002,375,680
2Nov 10, 2025 02:17110,793931,303,017743,591,000164,909,0002,363,392
3Nov 10, 2025 02:17116,306982,421,692784,940,000168,772,0002,490,368
4Nov 10, 2025 02:17119,0721,006,415,808813,493,000162,898,0002,334,720
5Nov 10, 2025 02:17126,7391,064,994,535872,379,000166,881,0002,510,848
6Nov 10, 2025 02:17127,9621,073,196,433884,401,000164,888,0002,469,888
7Nov 10, 2025 02:17130,9351,107,572,293901,879,000171,786,0002,334,720
8Nov 10, 2025 02:17133,3751,125,092,197924,879,000168,795,0002,359,296
9Nov 10, 2025 02:17144,2211,207,482,4981,014,809,000167,803,0002,412,544