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 19, 2026 17:39Victor MerckléVictor MerckléScore: 3,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:403,33734,985,63826,312,0001,056,0002,113,536
2Jun 19, 2026 17:403,37635,278,53626,660,0001,030,0002,113,536
3Jun 19, 2026 17:403,40035,459,01126,845,0001,042,0002,113,536
4Jun 19, 2026 17:403,41535,637,46426,958,0001,045,0002,113,536
5Jun 19, 2026 17:403,43435,805,86827,106,0001,056,0002,113,536
6Jun 19, 2026 17:403,46235,977,99227,348,0001,045,0002,113,536
7Jun 19, 2026 17:403,83739,122,73729,424,0002,047,0002,113,536
8Jun 19, 2026 17:406,23158,670,24150,069,0001,029,0002,113,536
9Jun 19, 2026 17:406,33359,893,27550,909,0001,026,0002,113,536