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 listSep 3, 2026 04:43Josu San MartinJosu San MartinScore: 3,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:443,79441,928,29129,093,0002,022,0002,113,536
2Sep 3, 2026 04:443,79941,393,02529,132,0002,020,0002,113,536
3Sep 3, 2026 04:443,80041,211,19329,049,0002,113,0002,113,536
4Sep 3, 2026 04:443,80641,488,44729,019,0002,197,0002,113,536
5Sep 3, 2026 04:443,80641,960,67429,152,0002,061,0002,113,536
6Sep 3, 2026 04:443,82241,297,04729,252,0002,093,0002,113,536
7Sep 3, 2026 04:443,85141,625,20429,397,0002,185,0002,113,536
8Sep 3, 2026 04:4411,468104,883,54587,752,0006,293,0002,113,536
9Sep 3, 2026 04:4421,176183,737,462166,560,0007,091,0002,117,632