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 10, 2026 04:31olliecrowolliecrowScore: 12,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 04:3111,988127,711,46895,291,0003,009,0002,412,544
2Mar 10, 2026 04:3111,992118,266,85597,332,0001,003,0002,412,544
3Mar 10, 2026 04:3111,996118,955,19297,361,0001,003,0002,519,040
4Mar 10, 2026 04:3111,999124,438,24996,385,0002,008,0002,461,696
5Mar 10, 2026 04:3112,007128,334,80997,455,0001,004,0002,445,312
6Mar 10, 2026 04:3112,017125,097,25897,536,0001,005,0002,428,928
7Mar 10, 2026 04:3112,018125,958,21197,542,0001,005,0002,457,600
8Mar 10, 2026 04:3112,022130,014,28697,575,0001,005,0002,424,832
9Mar 10, 2026 04:3112,044123,231,31596,767,0001,995,0002,449,408