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:01Victor MerckléVictor MerckléScore: 10,465Success
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:027,78985,108,06616,472,00047,403,0002,125,824stderr
2Aug 23, 2026 16:027,84581,757,96416,553,00047,784,0002,125,824stderr
3Aug 23, 2026 16:027,91883,117,54917,263,00047,669,0002,125,824stderr
4Aug 23, 2026 16:028,06687,433,15218,708,00047,438,0002,125,824stderr
5Aug 23, 2026 16:0210,465103,268,90437,918,00047,898,0002,121,728stderr
6Aug 23, 2026 16:0210,476103,437,19538,650,00047,254,0002,121,728stderr
7Aug 23, 2026 16:0210,545106,844,37238,710,00047,760,0002,121,728stderr
8Aug 23, 2026 16:0210,598105,317,33039,095,00047,815,0002,121,728stderr
9Aug 23, 2026 16:0210,659105,431,46339,340,00048,069,0002,121,728stderr