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:56Victor MerckléVictor MerckléScore: 3,433Success
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:573,38036,819,55126,659,0001,062,0002,113,536
2Jun 12, 2026 11:573,39336,923,24326,767,0001,059,0002,113,536
3Jun 12, 2026 11:573,42937,536,25926,110,0002,009,0002,113,536
4Jun 12, 2026 11:573,43137,255,61226,043,0002,094,0002,113,536
5Jun 12, 2026 11:573,43337,618,79626,120,0002,034,0002,113,536
6Jun 12, 2026 11:573,43537,339,42827,105,0001,064,0002,113,536
7Jun 12, 2026 11:573,46338,530,55526,279,0002,124,0002,113,536
8Jun 12, 2026 11:573,47037,508,39827,395,0001,063,0002,113,536
9Jun 12, 2026 11:573,65939,517,84427,946,0002,061,0002,113,536