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:00Victor MerckléVictor MerckléScore: 3,435Success
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:063,34935,070,82626,409,0001,054,0002,113,536
2Jun 12, 2026 09:063,36735,102,69126,546,0001,064,0002,113,536
3Jun 12, 2026 09:063,38735,299,69026,714,0001,062,0002,113,536
4Jun 12, 2026 09:063,41435,625,89326,925,0001,070,0002,113,536
5Jun 12, 2026 09:063,43535,686,32327,119,0001,056,0002,113,536
6Jun 12, 2026 09:063,53536,512,61026,839,0002,151,0002,113,536
7Jun 12, 2026 09:066,48560,712,31552,164,0001,016,0002,113,536
8Jun 12, 2026 09:0612,899113,370,119103,758,0002,015,0002,113,536
9Jun 12, 2026 09:0612,969113,889,252104,316,0002,033,0002,113,536