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 5, 2026 03:48Victor MerckléVictor MerckléScore: 3,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 03:493,37036,718,18126,584,0001,053,0002,113,536
2Jun 5, 2026 03:493,38536,884,87026,696,0001,067,0002,113,536
3Jun 5, 2026 03:493,44237,350,61126,113,0002,117,0002,113,536
4Jun 5, 2026 03:493,47837,582,53827,487,0001,038,0002,113,536
5Jun 5, 2026 03:493,48037,668,95327,494,0001,047,0002,113,536
6Jun 5, 2026 03:493,84941,305,68129,238,0002,326,0002,113,536
7Jun 5, 2026 03:493,85540,744,62729,288,0002,327,0002,113,536
8Jun 5, 2026 03:493,92741,349,32730,109,0002,096,0002,113,536
9Jun 5, 2026 03:4913,050116,127,249104,999,0002,017,0002,113,536