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 29, 2026 13:59Victor MerckléVictor MerckléScore: 2,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:022,72830,707,86921,294,0001,083,0002,117,632stderr
2Aug 29, 2026 14:022,73330,534,73121,316,0001,099,0002,117,632stderr
3Aug 29, 2026 14:022,74830,827,83021,528,0001,011,0002,117,632stderr
4Aug 29, 2026 14:022,75331,015,69021,408,0001,173,0002,117,632stderr
5Aug 29, 2026 14:022,76530,869,15021,649,0001,027,0002,117,632stderr
6Aug 29, 2026 14:025,38952,319,15843,166,0001,030,0002,117,632stderr
7Aug 29, 2026 14:025,38952,299,80543,139,0001,053,0002,117,632stderr
8Aug 29, 2026 14:025,40252,617,47643,176,0001,124,0002,117,632stderr
9Aug 29, 2026 14:025,41552,733,79243,264,0001,144,0002,117,632stderr