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 listJul 15, 2026 17:07Maya RebholzMaya RebholzScore: 5,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 17:104,87749,675,00037,492,0002,506,0002,113,536
2Jul 15, 2026 17:105,01850,877,55138,634,0002,515,0002,113,536
3Jul 15, 2026 17:105,06751,263,96339,188,0002,366,0002,113,536
4Jul 15, 2026 17:105,09552,070,88339,219,0002,560,0002,113,536
5Jul 15, 2026 17:105,16052,695,54539,926,0002,390,0002,113,536
6Jul 15, 2026 17:105,31153,360,56641,079,0002,477,0002,113,536
7Jul 15, 2026 17:105,74257,408,67544,676,0002,412,0002,113,536
8Jul 15, 2026 17:105,83658,283,68645,407,0002,456,0002,113,536
9Jul 15, 2026 17:106,24461,542,78648,782,0002,421,0002,113,536