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 listSep 1, 2026 05:53Victor MerckléVictor MerckléScore: 5,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 05:542,97032,746,08023,019,0001,342,0002,117,632stderr
2Sep 1, 2026 05:542,97232,766,62723,060,0001,314,0002,117,632stderr
3Sep 1, 2026 05:542,99132,886,07023,244,0001,286,0002,117,632stderr
4Sep 1, 2026 05:543,00334,037,84223,601,0001,027,0002,117,632stderr
5Sep 1, 2026 05:545,73955,516,05844,962,0002,100,0002,117,632stderr
6Sep 1, 2026 05:545,74756,117,10844,917,0002,214,0002,117,632stderr
7Sep 1, 2026 05:545,75955,597,52545,026,0002,199,0002,117,632stderr
8Sep 1, 2026 05:545,76856,834,29145,181,0002,124,0002,117,632stderr
9Sep 1, 2026 05:545,80455,923,60445,372,0002,224,0002,117,632stderr