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 listAug 31, 2026 12:44Victor MerckléVictor MerckléScore: 5,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:452,71930,438,53621,253,0001,045,0002,113,536
2Aug 31, 2026 12:452,72930,791,56021,317,0001,064,0002,113,536
3Aug 31, 2026 12:452,74731,522,33821,378,0001,149,0002,113,536
4Aug 31, 2026 12:452,76530,917,53221,517,0001,159,0002,113,536
5Aug 31, 2026 12:455,36352,173,03442,959,0001,022,0002,113,536
6Aug 31, 2026 12:455,38352,426,11543,039,0001,109,0002,113,536
7Aug 31, 2026 12:455,41252,496,28343,347,0001,033,0002,113,536
8Aug 31, 2026 12:455,42052,838,36343,343,0001,105,0002,113,536
9Aug 31, 2026 12:455,42752,908,31143,379,0001,130,0002,113,536