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 19, 2026 15:09Victor MerckléVictor MerckléScore: 5,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:102,76031,092,65621,626,0001,012,0002,117,632stderr
2Aug 19, 2026 15:102,76331,649,46721,638,0001,023,0002,117,632stderr
3Aug 19, 2026 15:102,76530,989,68821,652,0001,022,0002,117,632stderr
4Aug 19, 2026 15:105,37652,384,18443,047,0001,037,0002,117,632stderr
5Aug 19, 2026 15:105,40552,521,47943,288,0001,037,0002,117,632stderr
6Aug 19, 2026 15:105,40952,663,53843,240,0001,116,0002,117,632stderr
7Aug 19, 2026 15:105,42152,802,95643,176,0001,284,0002,117,632stderr
8Aug 19, 2026 15:105,42453,619,75943,312,0001,169,0002,117,632stderr
9Aug 19, 2026 15:105,46053,002,27843,595,0001,181,0002,117,632stderr