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 19, 2026 10:10Victor MerckléVictor MerckléScore: 5,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 10:122,84531,460,02522,292,0001,045,0002,117,632stderr
2Aug 19, 2026 10:122,85031,486,18722,227,0001,147,0002,117,632stderr
3Aug 19, 2026 10:122,85731,704,10222,412,0001,019,0002,117,632stderr
4Aug 19, 2026 10:122,91732,233,98622,774,0001,149,0002,117,632stderr
5Aug 19, 2026 10:125,44852,799,38443,640,0001,036,0002,117,632stderr
6Aug 19, 2026 10:125,45852,916,74043,719,0001,039,0002,117,632stderr
7Aug 19, 2026 10:125,51953,495,98644,210,0001,049,0002,117,632stderr
8Aug 19, 2026 10:125,52953,740,65844,308,0001,034,0002,117,632stderr
9Aug 19, 2026 10:125,57153,940,12344,545,0001,138,0002,117,632stderr