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 4, 2026 14:34olliecrowolliecrowScore: 12,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 14:3412,125126,008,06496,410,0003,012,0002,428,928
2Mar 4, 2026 14:3412,130125,199,43999,470,00002,469,888
3Mar 4, 2026 14:3412,132129,344,06896,496,0002,984,0002,433,024
4Mar 4, 2026 14:3412,136130,120,14497,502,0002,010,0002,457,600
5Mar 4, 2026 14:3412,160128,893,90197,719,0001,994,0002,428,928
6Mar 4, 2026 14:3412,161133,340,63298,722,000997,0002,412,544
7Mar 4, 2026 14:3412,166128,988,49995,768,0003,990,0002,433,024
8Mar 4, 2026 14:3412,167126,244,80098,774,000997,0002,408,448
9Mar 4, 2026 14:3412,167126,726,34197,778,0001,995,0002,412,544