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 23, 2026 16:04Victor MerckléVictor MerckléScore: 10,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:057,37078,481,94914,003,00046,436,0002,125,824stderr
2Aug 23, 2026 16:057,41078,527,26213,881,00046,886,0002,125,824stderr
3Aug 23, 2026 16:057,44478,596,29614,747,00046,301,0002,125,824stderr
4Aug 23, 2026 16:057,52279,695,58814,825,00046,857,0002,125,824stderr
5Aug 23, 2026 16:0510,047100,611,45136,365,00046,021,0002,121,728stderr
6Aug 23, 2026 16:0510,089101,051,05036,197,00046,534,0002,121,728stderr
7Aug 23, 2026 16:0510,107101,158,65736,074,00046,808,0002,121,728stderr
8Aug 23, 2026 16:0510,109103,652,70736,586,00046,315,0002,121,728stderr
9Aug 23, 2026 16:0519,917184,318,156116,229,00047,096,0002,121,728stderr