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 06:28olliecrowolliecrowScore: 16,081Success
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 06:2516,010159,935,822126,276,0005,010,0002,359,296
2Mar 4, 2026 06:2816,010157,606,908127,278,0004,008,0002,412,544
3Mar 4, 2026 06:2516,066160,348,976126,754,0004,990,0002,527,232
4Mar 4, 2026 06:2516,075163,069,915126,819,0004,992,0002,318,336
5Mar 4, 2026 06:2516,081162,206,266126,869,0004,994,0002,310,144
6Mar 4, 2026 06:2516,088159,232,832126,928,0004,997,0002,441,216
7Mar 4, 2026 06:2516,096159,727,620125,991,0005,999,0002,351,104
8Mar 4, 2026 06:2816,102159,912,269129,037,0003,000,0002,342,912
9Mar 4, 2026 06:2816,220164,211,368127,000,0006,000,0002,408,448