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 listAug 31, 2026 12:40Victor MerckléVictor MerckléScore: 2,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:412,78531,209,82921,495,0001,343,00024,576stderr
2Aug 31, 2026 12:412,80731,341,34821,904,0001,114,00024,576stderr
3Aug 31, 2026 12:412,80831,258,30321,702,0001,325,00024,576stderr
4Aug 31, 2026 12:412,81431,435,16121,977,0001,100,00024,576stderr
5Aug 31, 2026 12:412,82531,579,02322,141,0001,030,00024,576stderr
6Aug 31, 2026 12:412,82532,124,30322,054,0001,119,00024,576stderr
7Aug 31, 2026 12:412,86831,845,84922,439,0001,080,00024,576stderr
8Aug 31, 2026 12:415,48253,232,06343,936,0001,018,00024,576stderr
9Aug 31, 2026 12:415,54353,732,35044,417,0001,037,00024,576stderr