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 listJun 16, 2026 19:02Maya RebholzMaya RebholzScore: 46,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 19:0544,781376,516,558327,031,00040,178,0002,281,472
2Jun 16, 2026 19:0545,345381,179,251331,266,00040,565,0002,281,472
3Jun 16, 2026 19:0545,655384,082,460333,802,00040,574,0002,281,472
4Jun 16, 2026 19:0546,271388,803,736339,051,00040,378,0002,281,472
5Jun 16, 2026 19:0546,514391,359,977340,837,00040,583,0002,281,472
6Jun 16, 2026 19:0546,546391,014,006341,703,00039,981,0002,281,472
7Jun 16, 2026 19:0546,757392,682,019340,924,00042,490,0002,281,472
8Jun 16, 2026 19:0546,877394,413,834343,591,00040,806,0002,281,472
9Jun 16, 2026 19:0547,995403,009,846353,240,00040,326,0002,281,472