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:08Victor MerckléVictor MerckléScore: 3,407Success
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:093,32134,652,42026,190,0001,048,0002,113,536
2Jun 12, 2026 11:093,34634,937,49826,406,0001,038,0002,113,536
3Jun 12, 2026 11:093,39135,220,16126,776,0001,032,0002,113,536
4Jun 12, 2026 11:093,39835,362,57026,835,0001,030,0002,113,536
5Jun 12, 2026 11:093,40735,304,96226,899,0001,040,0002,113,536
6Jun 12, 2026 11:093,41035,314,80826,919,0001,046,0002,113,536
7Jun 12, 2026 11:093,43735,674,38327,149,0001,041,0002,113,536
8Jun 12, 2026 11:093,48536,003,24327,548,0001,033,0002,113,536
9Jun 12, 2026 11:093,52336,372,35027,853,0001,043,0002,113,536