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:47Victor MerckléVictor MerckléScore: 3,213Success
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:473,15533,284,62124,848,0001,027,0002,113,536
2Jun 23, 2026 16:473,16833,424,54424,948,0001,032,0002,113,536
3Jun 23, 2026 16:473,18633,538,95025,095,0001,032,0002,113,536
4Jun 23, 2026 16:473,19133,828,52125,140,0001,033,0002,113,536
5Jun 23, 2026 16:473,21333,795,37025,320,0001,031,0002,113,536
6Jun 23, 2026 16:473,22533,924,26625,413,0001,036,0002,113,536
7Jun 23, 2026 16:473,22633,997,55125,423,0001,033,0002,113,536
8Jun 23, 2026 16:473,25634,740,73725,671,0001,033,0002,113,536
9Jun 23, 2026 16:4712,258107,945,68399,513,0001,008,0002,113,536