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 4, 2026 08:18Victor MerckléVictor MerckléScore: 5,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:232,98933,612,76723,489,0001,023,0002,117,632stderr
2Sep 4, 2026 08:232,98932,905,46523,461,0001,054,0002,117,632stderr
3Sep 4, 2026 08:233,02133,177,58723,743,0001,036,0002,117,632stderr
4Sep 4, 2026 08:233,02733,313,65323,808,0001,019,0002,117,632stderr
5Sep 4, 2026 08:235,63654,599,51445,069,0001,148,0002,117,632stderr
6Sep 4, 2026 08:235,65354,489,99945,209,0001,150,0002,117,632stderr
7Sep 4, 2026 08:235,66054,805,26945,268,0001,150,0002,117,632stderr
8Sep 4, 2026 08:235,67154,670,02945,314,0001,194,0002,117,632stderr
9Sep 4, 2026 08:235,68854,989,97745,633,0001,013,0002,117,632stderr