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 23, 2026 16:13Victor MerckléVictor MerckléScore: 2,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:142,75230,885,64521,484,0001,090,0002,117,632stderr
2Aug 23, 2026 16:142,75431,491,20521,416,0001,172,0002,117,632stderr
3Aug 23, 2026 16:142,75530,928,23721,504,0001,094,0002,117,632stderr
4Aug 23, 2026 16:142,75830,989,34821,480,0001,141,0002,117,632stderr
5Aug 23, 2026 16:142,76231,595,33721,630,0001,024,0002,117,632stderr
6Aug 23, 2026 16:142,77131,731,19221,704,0001,022,0002,117,632stderr
7Aug 23, 2026 16:142,78231,190,39821,650,0001,169,0002,117,632stderr
8Aug 23, 2026 16:145,37452,449,91542,996,0001,078,0002,117,632stderr
9Aug 23, 2026 16:145,40952,706,01943,213,0001,144,0002,117,632stderr