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 listAug 3, 2026 13:51Victor MerckléVictor MerckléScore: 3,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 13:513,17334,429,18224,965,0001,055,0002,117,632stderr
2Aug 3, 2026 13:513,19836,580,92025,207,0001,022,0002,117,632stderr
3Aug 3, 2026 13:513,20234,689,03925,216,0001,041,0002,117,632stderr
4Aug 3, 2026 13:513,22135,011,98525,383,0001,031,0002,117,632stderr
5Aug 3, 2026 13:513,28735,339,62825,895,0001,063,0002,117,632stderr
6Aug 3, 2026 13:513,29135,477,54025,947,0001,045,0002,117,632stderr
7Aug 3, 2026 13:513,31235,561,08326,107,0001,055,0002,117,632stderr
8Aug 3, 2026 13:5112,090107,528,26798,135,0001,009,0002,117,632stderr
9Aug 3, 2026 13:5112,252108,857,59299,461,0001,012,0002,117,632stderr