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 19:08e1011e1011Score: 123,191Success
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 19:0984,165701,569,778548,938,000141,215,0002,113,536
2Nov 4, 2026 19:0990,779755,319,512602,597,000141,798,0002,113,536
3Nov 4, 2026 19:0996,744804,753,001652,212,000141,094,0002,113,536
4Nov 4, 2026 19:09102,845855,863,937705,083,000138,246,0002,113,536
5Nov 4, 2026 19:09123,1911,021,208,580871,730,000138,438,0002,113,536
6Nov 4, 2026 19:09133,4141,105,024,227952,277,000141,721,0002,113,536
7Nov 4, 2026 19:09134,4961,113,913,040961,034,000141,836,0002,113,536
8Nov 4, 2026 19:09137,8571,141,421,774988,775,000141,659,0002,113,536
9Nov 4, 2026 19:09148,4441,228,869,2771,078,354,000138,889,0002,113,536