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 09:10Victor MerckléVictor MerckléScore: 3,441Success
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 09:173,34034,961,22426,343,0001,048,0002,113,536
2Jun 12, 2026 09:173,34434,961,89626,380,0001,045,0002,113,536
3Jun 12, 2026 09:173,35935,058,56726,479,0001,065,0002,113,536
4Jun 12, 2026 09:173,41435,575,95626,938,0001,060,0002,113,536
5Jun 12, 2026 09:173,44135,767,58827,167,0001,056,0002,113,536
6Jun 12, 2026 09:173,44935,919,08227,215,0001,071,0002,113,536
7Jun 12, 2026 09:173,46536,076,24327,365,0001,050,0002,113,536
8Jun 12, 2026 09:173,55536,708,17426,936,0002,217,0002,113,536
9Jun 12, 2026 09:173,55536,684,08828,091,0001,063,0002,113,536