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 listApr 25, 2026 06:35limanjun99limanjun99Score: 4,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 06:364,34752,010,62733,616,0002,037,0002,494,464
2Apr 25, 2026 06:364,35151,841,65531,718,0003,964,0002,314,240
3Apr 25, 2026 06:364,43653,165,63233,351,0003,031,0002,310,144
4Apr 25, 2026 06:364,45057,329,95435,479,0001,013,0002,551,808
5Apr 25, 2026 06:364,49655,031,09433,883,0002,989,0002,527,232
6Apr 25, 2026 06:364,50151,933,91731,924,0004,988,0002,396,160
7Apr 25, 2026 06:364,50855,132,08933,973,0002,997,0002,314,240
8Apr 25, 2026 06:364,50854,275,77731,976,0004,996,0002,297,856
9Apr 25, 2026 06:364,51651,323,91033,029,0004,003,0002,506,752