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 22, 2026 07:35olliecrowolliecrowScore: 46,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 07:3812,149107,821,48098,622,0001,006,0002,551,808
2Apr 22, 2026 07:3812,246118,559,84799,415,0001,004,0002,461,696
3Apr 22, 2026 07:3812,311108,383,55397,923,0003,028,0002,330,624
4Apr 22, 2026 07:3846,197387,411,577373,821,0004,997,0002,379,776
5Apr 22, 2026 07:3846,250397,798,717376,253,0003,002,0002,416,640
6Apr 22, 2026 07:3846,289388,348,253375,582,0003,995,0002,424,832
7Apr 22, 2026 07:3846,352387,674,599375,093,0005,001,0002,355,200
8Apr 22, 2026 07:3846,384388,896,438375,360,0004,991,0002,359,296
9Apr 22, 2026 07:3846,432389,642,142377,748,0002,998,0002,326,528