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 14:55Victor MerckléVictor MerckléScore: 2,790Success
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 14:562,76131,002,62521,592,0001,051,0002,117,632stderr
2Aug 19, 2026 14:562,77131,086,26821,678,0001,048,0002,117,632stderr
3Aug 19, 2026 14:562,77731,144,18121,725,0001,053,0002,117,632stderr
4Aug 19, 2026 14:562,78130,940,95221,758,0001,049,0002,117,632stderr
5Aug 19, 2026 14:562,79031,301,21721,756,0001,129,0002,117,632stderr
6Aug 19, 2026 14:562,80031,306,36121,830,0001,131,0002,117,632stderr
7Aug 19, 2026 14:565,46953,017,12743,836,0001,017,0002,117,632stderr
8Aug 19, 2026 14:565,48453,392,32343,950,0001,019,0002,117,632stderr
9Aug 19, 2026 14:565,50553,263,37444,123,0001,021,0002,117,632stderr