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 19, 2026 13:03Victor MerckléVictor MerckléScore: 2,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 13:042,82731,350,50222,053,0001,129,0002,121,728stderr
2Aug 19, 2026 13:042,83831,839,96522,247,0001,031,0002,121,728stderr
3Aug 19, 2026 13:042,84531,555,63022,228,0001,105,0002,121,728stderr
4Aug 19, 2026 13:042,89632,723,00322,578,0001,175,0002,121,728stderr
5Aug 19, 2026 13:042,90432,839,92222,623,0001,190,0002,121,728stderr
6Aug 19, 2026 13:042,99634,680,77123,350,0001,224,0002,121,728stderr
7Aug 19, 2026 13:045,49354,037,41543,893,0001,151,0002,121,728stderr
8Aug 19, 2026 13:045,53253,654,83244,196,0001,173,0002,121,728stderr
9Aug 19, 2026 13:045,64554,490,16445,251,0001,038,0002,121,728stderr