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 listApr 30, 2026 08:49Victor MerckléVictor MerckléScore: 82,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 08:5182,339691,416,997671,183,0004,001,0002,457,600stderr
2Apr 30, 2026 08:5182,393694,574,064674,631,000999,0002,314,240stderr
3Apr 30, 2026 08:5182,402694,466,500673,704,0001,999,0002,502,656stderr
4Apr 30, 2026 08:5182,484696,493,379672,379,0003,996,0002,367,488stderr
5Apr 30, 2026 08:5182,524696,777,560673,701,0002,998,0002,334,720stderr
6Apr 30, 2026 08:5182,552696,269,314675,930,000999,0002,527,232stderr
7Apr 30, 2026 08:5182,563695,996,780672,018,0005,000,0002,416,640stderr
8Apr 30, 2026 08:5182,906696,118,653677,835,0001,999,0002,355,200stderr
9Apr 30, 2026 08:5182,949703,149,164678,182,0002,000,0002,560,000stderr