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:53Josu San MartinJosu San MartinScore: 3,738Success
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:543,71040,435,00728,337,0002,087,0002,113,536
2Sep 3, 2026 04:543,72241,267,11428,383,0002,142,0002,117,632
3Sep 3, 2026 04:543,72441,366,38928,479,0002,059,0002,113,536
4Sep 3, 2026 04:543,73440,908,26028,556,0002,066,0002,113,536
5Sep 3, 2026 04:543,73841,422,47528,553,0002,103,0002,113,536
6Sep 3, 2026 04:543,74342,824,42828,597,0002,102,0002,113,536
7Sep 3, 2026 04:543,76141,710,68728,659,0002,189,0002,113,536
8Sep 3, 2026 04:5411,880107,476,40890,571,0006,847,0002,113,536
9Sep 3, 2026 04:5417,038150,543,442133,587,0006,130,0002,117,632