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 20:50e1011e1011Score: 32,779Success
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 20:5232,712279,148,101125,895,000142,351,0002,113,536
2Nov 4, 2026 20:5232,724279,404,817125,913,000142,424,0002,113,536
3Nov 4, 2026 20:5232,733279,346,063125,917,000142,496,0002,113,536
4Nov 4, 2026 20:5232,763279,569,266126,250,000142,414,0002,113,536
5Nov 4, 2026 20:5232,779279,756,372126,869,000141,920,0002,113,536
6Nov 4, 2026 20:5233,050281,988,742128,150,000142,865,0002,113,536
7Nov 4, 2026 20:5233,290283,992,264129,982,000143,004,0002,113,536
8Nov 4, 2026 20:5233,329284,290,572130,594,000142,707,0002,113,536
9Nov 4, 2026 20:5233,631287,189,156133,270,000142,508,0002,113,536