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 15:58Maya RebholzMaya RebholzScore: 31,706Success
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 15:5930,134256,321,766217,761,00029,338,0002,281,472
2Jun 16, 2026 15:5930,510259,754,541222,820,00027,369,0002,281,472
3Jun 16, 2026 15:5930,803261,840,617223,463,00029,127,0002,281,472
4Jun 16, 2026 15:5931,457268,122,886230,615,00027,339,0002,281,472
5Jun 16, 2026 15:5931,706269,146,566230,662,00029,330,0002,281,472
6Jun 16, 2026 15:5931,717270,886,269232,748,00027,333,0002,281,472
7Jun 16, 2026 15:5931,861270,869,506234,357,00026,911,0002,281,472
8Jun 16, 2026 15:5932,006272,046,791235,307,00027,143,0002,281,472
9Jun 16, 2026 15:5932,989280,071,991243,158,00027,352,0002,281,472