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 16, 2026 09:52marko1597marko1597Score: 7,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 10:062,79032,076,63621,758,0001,127,0002,117,632stderr
2Aug 16, 2026 10:062,80331,440,07721,704,0001,285,0002,117,632stderr
3Aug 16, 2026 10:066,90065,277,33355,551,0001,034,0002,117,632stderr
4Aug 16, 2026 10:066,98369,964,13656,222,0001,044,0002,117,632stderr
5Aug 16, 2026 10:067,00565,889,33456,411,0001,035,0002,117,632stderr
6Aug 16, 2026 10:067,01366,612,13756,477,0001,031,0002,117,632stderr
7Aug 16, 2026 10:067,02367,958,62456,501,0001,093,0002,117,632stderr
8Aug 16, 2026 10:067,04866,170,65756,781,0001,019,0002,117,632stderr
9Aug 16, 2026 10:067,06766,354,58056,925,0001,026,0002,117,632stderr