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 8, 2026 15:49Victor MerckléVictor MerckléScore: 3,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 15:503,37536,801,58026,602,0001,074,0002,113,536
2Jun 8, 2026 15:503,39337,477,28126,753,0001,071,0002,113,536
3Jun 8, 2026 15:503,39536,984,24826,770,0001,069,0002,113,536
4Jun 8, 2026 15:503,41537,133,61726,955,0001,048,0002,113,536
5Jun 8, 2026 15:503,43037,240,77026,048,0002,084,0002,113,536
6Jun 8, 2026 15:503,46037,519,87626,355,0002,022,0002,113,536
7Jun 8, 2026 15:503,46138,877,50726,324,0002,061,0002,113,536
8Jun 8, 2026 15:503,47937,783,32027,468,0001,062,0002,113,536
9Jun 8, 2026 15:5012,740113,646,078102,258,0002,218,0002,113,536