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 4, 2026 21:39e1011e1011Score: 18,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 21:4118,091159,191,180146,164,0002,183,0002,113,536
2Nov 4, 2026 21:4118,184160,555,883147,097,0002,013,0002,113,536
3Nov 4, 2026 21:4118,213160,328,198147,335,0002,013,0002,113,536
4Nov 4, 2026 21:4118,232160,987,029147,495,0002,013,0002,113,536
5Nov 4, 2026 21:4118,299161,004,860148,039,0002,014,0002,113,536
6Nov 4, 2026 21:4118,305160,953,773148,089,0002,014,0002,113,536
7Nov 4, 2026 21:4118,326161,112,919148,264,0002,012,0002,113,536
8Nov 4, 2026 21:4118,345161,257,313148,420,0002,011,0002,113,536
9Nov 4, 2026 21:4118,358161,420,489148,528,0002,015,0002,113,536