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 22, 2026 02:19Victor MerckléVictor MerckléScore: 3,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 02:203,33236,101,38626,297,0001,031,0002,113,536
2Jun 22, 2026 02:203,34134,827,80226,349,0001,051,0002,113,536
3Jun 22, 2026 02:203,34534,888,05826,375,0001,061,0002,113,536
4Jun 22, 2026 02:203,35335,066,06226,442,0001,057,0002,113,536
5Jun 22, 2026 02:203,37335,048,13326,610,0001,054,0002,113,536
6Jun 22, 2026 02:203,38635,300,78026,727,0001,041,0002,113,536
7Jun 22, 2026 02:2012,749111,999,147102,366,0002,177,0002,113,536
8Jun 22, 2026 02:2012,843112,829,410103,103,0002,211,0002,113,536
9Jun 22, 2026 02:2012,858113,003,136103,415,0002,028,0002,113,536