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 18, 2026 15:15Victor MerckléVictor MerckléScore: 3,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 15:202,94932,302,47223,144,0001,038,0002,117,632stderr
2Aug 18, 2026 15:202,95633,268,37623,177,0001,064,0002,117,632stderr
3Aug 18, 2026 15:203,00032,745,76523,546,0001,061,0002,117,632stderr
4Aug 18, 2026 15:203,04233,211,52423,889,0001,060,0002,117,632stderr
5Aug 18, 2026 15:203,04433,152,83123,890,0001,078,0002,117,632stderr
6Aug 18, 2026 15:203,07136,481,72524,141,0001,046,0002,117,632stderr
7Aug 18, 2026 15:205,74355,220,99344,907,0002,189,0002,117,632stderr
8Aug 18, 2026 15:205,78855,564,72145,238,0002,224,0002,117,632stderr
9Aug 18, 2026 15:205,79055,804,99945,451,0002,033,0002,117,632stderr