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:03Maya RebholzMaya RebholzScore: 37,326Success
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:0635,835303,565,012251,959,00041,896,0002,281,472
2Jun 16, 2026 19:0636,009304,932,069255,312,00039,969,0002,281,472
3Jun 16, 2026 19:0636,476308,818,932260,059,00039,046,0002,281,472
4Jun 16, 2026 19:0636,883312,073,634261,578,00040,865,0002,281,472
5Jun 16, 2026 19:0637,326315,317,951262,412,00043,665,0002,281,472
6Jun 16, 2026 19:0637,552317,146,036264,228,00043,705,0002,281,472
7Jun 16, 2026 19:0637,872319,911,249267,765,00042,790,0002,281,472
8Jun 16, 2026 19:0637,903320,378,814270,161,00040,648,0002,281,472
9Jun 16, 2026 19:0638,481324,854,727272,180,00043,365,0002,281,472