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 listJun 12, 2026 10:38Victor MerckléVictor MerckléScore: 3,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 10:383,34634,850,84426,396,0001,043,0002,113,536
2Jun 12, 2026 10:383,34634,818,51226,373,0001,066,0002,113,536
3Jun 12, 2026 10:383,35235,077,44226,447,0001,041,0002,113,536
4Jun 12, 2026 10:383,37035,029,19326,591,0001,047,0002,113,536
5Jun 12, 2026 10:383,37735,147,79426,629,0001,064,0002,113,536
6Jun 12, 2026 10:383,38235,153,54026,670,0001,067,0002,113,536
7Jun 12, 2026 10:383,39535,296,15926,794,0001,051,0002,113,536
8Jun 12, 2026 10:383,44435,632,41827,214,0001,029,0002,113,536
9Jun 12, 2026 10:386,43160,138,99351,714,0001,025,0002,113,536