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 listOct 2, 2026 07:31C21C21Score: 3,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 07:383,25537,319,28425,607,0001,085,0002,117,632stderr
2Oct 2, 2026 07:383,26937,555,46225,750,0001,059,0002,117,632stderr
3Oct 2, 2026 07:383,28337,600,50125,857,0001,067,0002,117,632stderr
4Oct 2, 2026 07:383,28337,582,63325,855,0001,066,0002,117,632stderr
5Oct 2, 2026 07:383,30637,712,24525,040,0002,076,0002,117,632stderr
6Oct 2, 2026 07:383,31437,840,20425,108,0002,072,0002,117,632stderr
7Oct 2, 2026 07:383,32237,883,61725,168,0002,079,0002,117,632stderr
8Oct 2, 2026 07:383,32437,976,38225,077,0002,182,0002,117,632stderr
9Oct 2, 2026 07:383,32537,936,12725,146,0002,121,0002,117,632stderr