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:25Victor MerckléVictor MerckléScore: 10,527Success
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:267,87572,974,65463,573,0001,009,0002,117,632stderr
2Aug 18, 2026 15:267,88072,956,42863,541,0001,082,0002,117,632stderr
3Aug 18, 2026 15:267,95173,372,34764,185,0001,014,0002,117,632stderr
4Aug 18, 2026 15:2610,52494,654,46885,080,0001,222,0002,117,632stderr
5Aug 18, 2026 15:2610,52794,688,07585,211,0001,117,0002,117,632stderr
6Aug 18, 2026 15:2610,54694,578,89285,369,0001,114,0002,117,632stderr
7Aug 18, 2026 15:2610,54694,920,57585,311,0001,170,0002,117,632stderr
8Aug 18, 2026 15:2610,57694,898,39885,723,0001,008,0002,117,632stderr
9Aug 18, 2026 15:2610,58395,153,33585,634,0001,151,0002,117,632stderr