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 16:32Victor MerckléVictor MerckléScore: 3,192Success
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 16:323,14933,258,29424,799,0001,027,0002,113,536
2Jun 23, 2026 16:323,15033,267,79724,804,0001,029,0002,113,536
3Jun 23, 2026 16:323,15133,563,61424,813,0001,028,0002,113,536
4Jun 23, 2026 16:323,17733,459,77725,024,0001,033,0002,113,536
5Jun 23, 2026 16:323,19233,763,54325,154,0001,028,0002,113,536
6Jun 23, 2026 16:323,22534,096,50725,414,0001,033,0002,113,536
7Jun 23, 2026 16:3212,173107,227,46798,816,0001,008,0002,113,536
8Jun 23, 2026 16:3212,228107,983,79699,264,0001,010,0002,113,536
9Jun 23, 2026 16:3212,341108,659,109100,196,0001,008,0002,113,536