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 listJun 23, 2026 14:07Victor MerckléVictor MerckléScore: 3,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 14:073,17033,443,00924,943,0001,054,0002,113,536
2Jun 23, 2026 14:073,17233,514,87924,965,0001,051,0002,113,536
3Jun 23, 2026 14:073,21434,022,28525,304,0001,057,0002,113,536
4Jun 23, 2026 14:073,21533,841,01725,304,0001,059,0002,113,536
5Jun 23, 2026 14:073,21833,812,37525,323,0001,068,0002,113,536
6Jun 23, 2026 14:073,22033,863,60224,345,0002,060,0002,113,536
7Jun 23, 2026 14:073,22033,910,16225,345,0001,067,0002,113,536
8Jun 23, 2026 14:073,26134,152,62025,667,0001,076,0002,113,536
9Jun 23, 2026 14:073,29734,530,44424,887,0002,149,0002,113,536