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 28, 2026 07:13Victor MerckléVictor MerckléScore: 12,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 07:143,01932,635,33123,640,0001,121,0002,117,632stderr
2Jun 28, 2026 07:143,08433,198,30824,251,0001,041,0002,117,632stderr
3Jun 28, 2026 07:143,10133,216,84024,394,0001,035,0002,117,632stderr
4Jun 28, 2026 07:143,13733,521,69924,677,0001,048,0002,117,632stderr
5Jun 28, 2026 07:1412,516110,511,459101,568,0001,066,0002,117,632stderr
6Jun 28, 2026 07:1412,545110,700,444101,716,0001,158,0002,117,632stderr
7Jun 28, 2026 07:1412,607111,251,290102,236,0001,148,0002,117,632stderr
8Jun 28, 2026 07:1412,633111,425,615102,449,0001,149,0002,117,632stderr
9Jun 28, 2026 07:1412,715112,196,560103,097,0001,168,0002,117,632stderr