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 17, 2026 15:07Maya RebholzMaya RebholzScore: 12,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:0811,939107,492,67696,885,0001,022,0002,113,536
2Jun 17, 2026 15:0811,977107,810,89197,189,0001,030,0002,113,536
3Jun 17, 2026 15:0811,984107,512,95397,261,0001,009,0002,113,536
4Jun 17, 2026 15:0812,009108,129,21197,423,0001,056,0002,113,536
5Jun 17, 2026 15:0812,017108,255,61197,521,0001,023,0002,113,536
6Jun 17, 2026 15:0812,027107,804,50997,618,0001,011,0002,113,536
7Jun 17, 2026 15:0812,260109,799,40599,521,0001,016,0002,113,536
8Jun 17, 2026 15:0812,734114,104,181103,391,0001,028,0002,113,536
9Jun 17, 2026 15:0812,757113,857,345103,589,0001,019,0002,113,536