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 listMay 10, 2026 13:26Pavel SkripkinPavel SkripkinScore: 4,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:274,13741,226,46930,694,0003,231,0002,117,632
2May 10, 2026 13:274,15944,733,62630,961,0003,150,0002,117,632
3May 10, 2026 13:274,17141,592,45031,006,0003,197,0002,117,632
4May 10, 2026 13:274,27345,728,00131,958,0003,087,0002,117,632
5May 10, 2026 13:274,35046,784,79031,302,0004,376,0002,117,632
6May 10, 2026 13:2724,670209,580,168199,181,0003,119,0002,117,632
7May 10, 2026 13:2724,731210,051,045199,280,0003,515,0002,117,632
8May 10, 2026 13:2724,840214,179,512198,560,0005,133,0002,117,632
9May 10, 2026 13:2725,420215,678,783204,410,0004,041,0002,117,632