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 23, 2026 20:57Victor MerckléVictor MerckléScore: 3,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 20:583,04432,725,26123,871,0001,096,0002,113,536
2Jun 23, 2026 20:583,06432,740,24423,931,0001,199,0002,113,536
3Jun 23, 2026 20:583,09032,931,30924,283,0001,057,0002,113,536
4Jun 23, 2026 20:583,09033,055,10724,226,0001,120,0002,113,536
5Jun 23, 2026 20:583,10133,031,11924,296,0001,133,0002,113,536
6Jun 23, 2026 20:585,95856,502,88347,839,0001,020,0002,113,536
7Jun 23, 2026 20:5812,171107,371,89398,796,0001,008,0002,113,536
8Jun 23, 2026 20:5812,774112,697,231103,740,0001,008,0002,113,536
9Jun 23, 2026 20:5812,780112,429,275103,790,0001,008,0002,113,536