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 listNov 5, 2026 04:23e1011e1011Score: 22,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 04:2422,743197,965,157184,492,0002,008,0002,113,536
2Nov 5, 2026 04:2422,787197,823,681184,838,0002,021,0002,113,536
3Nov 5, 2026 04:2422,829198,075,567185,195,0002,010,0002,113,536
4Nov 5, 2026 04:2422,866199,609,344185,495,0002,009,0002,113,536
5Nov 5, 2026 04:2422,868198,967,679185,500,0002,018,0002,113,536
6Nov 5, 2026 04:2422,876200,690,537185,576,0002,011,0002,113,536
7Nov 5, 2026 04:2422,902199,220,678185,788,0002,010,0002,113,536
8Nov 5, 2026 04:2422,913198,806,543185,877,0002,011,0002,113,536
9Nov 5, 2026 04:2422,914199,431,100185,886,0002,011,0002,113,536