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 05:10Josu San MartinJosu San MartinScore: 10,870Success
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 05:113,59039,472,02728,413,0001,030,0002,113,536
2Sep 3, 2026 05:119,82390,612,18075,503,0005,046,0002,113,536
3Sep 3, 2026 05:119,92492,196,87876,300,0005,078,0002,113,536
4Sep 3, 2026 05:1110,29094,454,96479,161,0005,217,0002,113,536
5Sep 3, 2026 05:1110,87099,167,93683,354,0005,785,0002,113,536
6Sep 3, 2026 05:1111,349103,158,56886,747,0006,316,0002,113,536
7Sep 3, 2026 05:1111,833107,081,78190,007,0007,029,0002,113,536
8Sep 3, 2026 05:1119,820172,613,844156,141,0006,389,0002,117,632
9Sep 3, 2026 05:1121,427185,706,302169,153,0006,554,0002,117,632