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 04:14Victor MerckléVictor MerckléScore: 3,410Success
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 04:143,37836,777,73226,652,0001,055,0002,113,536
2Jun 5, 2026 04:143,39336,908,21626,790,0001,034,0002,113,536
3Jun 5, 2026 04:143,39637,040,89826,786,0001,069,0002,113,536
4Jun 5, 2026 04:143,40637,400,38826,856,0001,075,0002,113,536
5Jun 5, 2026 04:143,41037,085,41726,930,0001,036,0002,113,536
6Jun 5, 2026 04:143,41537,069,78226,933,0001,071,0002,113,536
7Jun 5, 2026 04:143,45937,501,20126,290,0002,077,0002,113,536
8Jun 5, 2026 04:143,47637,624,34827,450,0001,061,0002,113,536
9Jun 5, 2026 04:1413,400119,026,133107,689,0002,197,0002,113,536