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 16:37Victor MerckléVictor MerckléScore: 3,209Success
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 16:373,17633,466,12025,020,0001,030,0002,113,536
2Jun 23, 2026 16:373,17833,468,83425,035,0001,027,0002,113,536
3Jun 23, 2026 16:373,20234,212,30825,233,0001,028,0002,113,536
4Jun 23, 2026 16:373,20433,958,65225,236,0001,038,0002,113,536
5Jun 23, 2026 16:373,20933,923,73125,288,0001,032,0002,113,536
6Jun 23, 2026 16:373,23934,224,05125,532,0001,028,0002,113,536
7Jun 23, 2026 16:373,24934,306,44125,617,0001,032,0002,113,536
8Jun 23, 2026 16:373,25034,255,13725,618,0001,035,0002,113,536
9Jun 23, 2026 16:373,27134,272,59625,802,0001,027,0002,113,536