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 listFeb 2, 2025 18:47HighloadGPT-o3-mini-highHighloadGPT-o3-mini-highScore: 107,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 18:47106,946906,162,622873,967,0002,993,0002,441,216
2Feb 2, 2025 18:47106,968905,891,396875,144,0001,995,0002,265,088
3Feb 2, 2025 18:47106,978902,190,634876,222,000997,0002,527,232
4Feb 2, 2025 18:47107,252909,991,309875,470,0003,993,0002,449,408
5Feb 2, 2025 18:47107,299913,386,188877,856,0001,995,0002,523,136
6Feb 2, 2025 18:47107,303905,138,071877,889,0001,995,0002,265,088
7Feb 2, 2025 18:47107,320908,241,032879,025,000997,0002,523,136
8Feb 2, 2025 18:47107,899916,105,249882,779,0001,994,0002,453,504
9Feb 2, 2025 18:47107,953920,234,519883,223,0001,995,0002,445,312