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, 2025 23:47AntonAntonScore: 22,902Success
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, 2025 23:4722,850213,460,926186,365,0001,001,0002,547,712
2Nov 4, 2025 23:4722,854217,685,903185,396,0002,004,0002,547,712
3Nov 4, 2025 23:4722,880214,226,723185,621,0001,995,0002,514,944
4Nov 4, 2025 23:4722,889212,055,854184,694,0002,995,0002,547,712
5Nov 4, 2025 23:4722,902213,514,602184,797,0002,996,0002,510,848
6Nov 4, 2025 23:4722,905213,390,782185,824,0001,998,0002,519,040
7Nov 4, 2025 23:4722,918213,804,892183,926,0003,998,0002,514,944
8Nov 4, 2025 23:4722,926215,173,955184,993,0002,999,0002,506,752
9Nov 4, 2025 23:4722,983219,351,149187,461,0001,002,0002,527,232