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 13:43Victor MerckléVictor MerckléScore: 5,518Success
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 13:442,82432,214,57822,013,0001,148,0002,117,632stderr
2Aug 19, 2026 13:442,83732,118,88222,120,0001,150,0002,117,632stderr
3Aug 19, 2026 13:442,87631,727,11522,439,0001,151,0002,117,632stderr
4Aug 19, 2026 13:445,47053,117,68343,705,0001,156,0002,117,632stderr
5Aug 19, 2026 13:445,51853,529,87244,118,0001,130,0002,117,632stderr
6Aug 19, 2026 13:445,51853,568,22144,108,0001,142,0002,117,632stderr
7Aug 19, 2026 13:445,55053,674,48144,383,0001,131,0002,117,632stderr
8Aug 19, 2026 13:445,57954,712,66744,598,0001,153,0002,117,632stderr
9Aug 19, 2026 13:445,65354,568,74445,209,0001,147,0002,117,632stderr