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 22:14Victor MerckléVictor MerckléScore: 3,140Success
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 22:163,06834,075,03224,042,0001,122,0002,113,536
2Jun 23, 2026 22:163,09933,115,46824,297,0001,118,0002,113,536
3Jun 23, 2026 22:163,11233,186,95624,330,0001,194,0002,113,536
4Jun 23, 2026 22:163,11633,128,10124,378,0001,181,0002,113,536
5Jun 23, 2026 22:163,14033,359,58624,722,0001,029,0002,113,536
6Jun 23, 2026 22:163,14533,433,93724,701,0001,094,0002,113,536
7Jun 23, 2026 22:163,42435,741,63227,061,0001,023,0002,113,536
8Jun 23, 2026 22:1612,025106,238,28997,597,0001,009,0002,113,536
9Jun 23, 2026 22:1612,600111,008,435102,311,0001,009,0002,113,536