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 listJul 2, 2026 14:13A_ShamanA_ShamanScore: 14,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:1414,283126,403,910115,079,0002,045,0002,113,536
2Jul 2, 2026 14:1414,445127,736,586116,427,0002,026,0002,113,536
3Jul 2, 2026 14:1414,448127,829,861116,417,0002,059,0002,113,536
4Jul 2, 2026 14:1414,456127,859,592116,490,0002,054,0002,113,536
5Jul 2, 2026 14:1414,549128,553,031117,143,0002,162,0002,113,536
6Jul 2, 2026 14:1414,613129,171,296117,730,0002,099,0002,113,536
7Jul 2, 2026 14:1414,718130,077,655118,517,0002,174,0002,113,536
8Jul 2, 2026 14:1414,767130,720,531118,879,0002,215,0002,113,536
9Jul 2, 2026 14:1414,798130,671,036119,068,0002,276,0002,113,536