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 18:41olliecrowolliecrowScore: 30,128Success
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 18:4129,564260,822,969240,429,0002,003,0002,342,912
2Apr 22, 2026 18:4129,813261,201,299242,466,0002,003,0002,523,136
3Apr 22, 2026 18:4129,963266,197,766242,707,0002,996,0002,523,136
4Apr 22, 2026 18:4130,070269,227,213243,587,0002,994,0002,527,232
5Apr 22, 2026 18:4130,128270,814,009244,057,0003,000,0002,519,040
6Apr 22, 2026 18:4130,195265,200,875244,610,0002,995,0002,514,944
7Apr 22, 2026 18:4130,203262,768,592244,673,0002,996,0002,523,136
8Apr 22, 2026 18:4130,273270,508,219246,239,0002,001,0002,514,944
9Apr 22, 2026 18:4130,300262,087,871246,457,0002,003,0002,523,136