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:16Josu San MartinJosu San MartinScore: 4,083Success
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:174,05043,258,37830,983,0002,235,0002,113,536
2Sep 3, 2026 04:174,05143,292,29131,008,0002,217,0002,113,536
3Sep 3, 2026 04:174,07544,200,50631,165,0002,253,0002,113,536
4Sep 3, 2026 04:174,08244,251,88531,202,0002,277,0002,113,536
5Sep 3, 2026 04:174,08344,251,62831,222,0002,262,0002,113,536
6Sep 3, 2026 04:174,08443,501,91131,170,0002,323,0002,113,536
7Sep 3, 2026 04:174,10743,739,45931,272,0002,411,0002,113,536
8Sep 3, 2026 04:1710,75898,217,96981,989,0006,227,0002,113,536
9Sep 3, 2026 04:1711,460104,708,86287,363,0006,617,0002,113,536