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 15, 2026 17:21Maya RebholzMaya RebholzScore: 5,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 17:225,25852,878,25440,604,0002,518,0002,113,536
2Jul 15, 2026 17:225,27752,986,72840,776,0002,498,0002,113,536
3Jul 15, 2026 17:225,29153,136,62540,899,0002,491,0002,113,536
4Jul 15, 2026 17:225,34353,645,57041,245,0002,571,0002,113,536
5Jul 15, 2026 17:225,36254,340,77541,431,0002,540,0002,113,536
6Jul 15, 2026 17:225,36854,316,97441,446,0002,575,0002,113,536
7Jul 15, 2026 17:225,40354,764,95141,712,0002,593,0002,113,536
8Jul 15, 2026 17:225,41854,835,56742,030,0002,402,0002,113,536
9Jul 15, 2026 17:225,47355,272,20842,285,0002,597,0002,113,536