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 11:25Victor MerckléVictor MerckléScore: 3,393Success
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 11:263,36034,963,94226,514,0001,046,0002,113,536
2Jun 12, 2026 11:263,37935,124,10026,681,0001,031,0002,113,536
3Jun 12, 2026 11:263,38135,597,14126,671,0001,058,0002,113,536
4Jun 12, 2026 11:263,38535,145,31526,706,0001,059,0002,113,536
5Jun 12, 2026 11:263,39335,229,31526,774,0001,055,0002,113,536
6Jun 12, 2026 11:263,41435,377,60126,945,0001,051,0002,113,536
7Jun 12, 2026 11:263,41535,632,11526,980,0001,031,0002,113,536
8Jun 12, 2026 11:266,43560,153,65451,750,0001,024,0002,113,536
9Jun 12, 2026 11:2613,327117,303,893107,081,0002,204,0002,113,536