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 20, 2026 18:08A_ShamanA_ShamanScore: 45,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 18:0944,650375,530,912185,852,000180,279,0002,113,536
2Jun 20, 2026 18:0944,980377,864,394185,713,000183,123,0002,113,536
3Jun 20, 2026 18:0944,992378,020,147186,227,000182,715,0002,113,536
4Jun 20, 2026 18:0945,055378,492,594185,747,000183,709,0002,117,632
5Jun 20, 2026 18:0945,177379,952,584186,014,000184,444,0002,113,536
6Jun 20, 2026 18:0945,282380,443,538186,046,000185,270,0002,113,536
7Jun 20, 2026 18:0945,368381,212,453192,478,000179,547,0002,113,536
8Jun 20, 2026 18:0945,417381,975,604192,414,000180,011,0002,113,536
9Jun 20, 2026 18:0945,627383,281,827192,014,000182,131,0002,113,536