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 14:02Victor MerckléVictor MerckléScore: 3,244Success
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 14:023,17133,477,70024,961,0001,049,0002,113,536
2Jun 23, 2026 14:023,21233,840,03425,279,0001,062,0002,113,536
3Jun 23, 2026 14:023,24134,069,73925,502,0001,079,0002,113,536
4Jun 23, 2026 14:023,24134,097,69625,527,0001,053,0002,113,536
5Jun 23, 2026 14:023,24434,266,41525,533,0001,075,0002,113,536
6Jun 23, 2026 14:023,30234,527,08925,044,0002,034,0002,113,536
7Jun 23, 2026 14:023,30634,536,36925,078,0002,032,0002,113,536
8Jun 23, 2026 14:023,31134,592,59125,120,0002,037,0002,113,536
9Jun 23, 2026 14:0212,107106,764,57697,195,0002,089,0002,113,536