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:30Victor MerckléVictor MerckléScore: 6,581Success
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:313,40140,581,53825,811,0002,078,0002,117,632
2Jun 12, 2026 10:313,40936,955,81226,919,0001,037,0002,113,536
3Jun 12, 2026 10:313,42837,203,84126,060,0002,052,0002,113,536
4Jun 12, 2026 10:313,50137,751,00626,603,0002,108,0002,113,536
5Jun 12, 2026 10:316,58163,024,90451,959,0002,012,0002,113,536
6Jun 12, 2026 10:316,58363,010,64751,948,0002,035,0002,113,536
7Jun 12, 2026 10:3112,947115,189,458104,156,0002,017,0002,113,536
8Jun 12, 2026 10:3113,394118,907,448107,583,0002,250,0002,113,536
9Jun 12, 2026 10:3113,551120,293,413109,089,0002,030,0002,113,536