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 15:47Victor MerckléVictor MerckléScore: 5,449Success
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 15:502,77431,032,42421,737,0001,016,0002,117,632stderr
2Aug 19, 2026 15:502,77731,074,43921,713,0001,061,0002,117,632stderr
3Aug 19, 2026 15:505,40252,542,14343,251,0001,050,0002,117,632stderr
4Aug 19, 2026 15:505,44752,930,74243,556,0001,114,0002,117,632stderr
5Aug 19, 2026 15:505,44952,965,16643,395,0001,287,0002,117,632stderr
6Aug 19, 2026 15:505,46953,861,24843,696,0001,152,0002,117,632stderr
7Aug 19, 2026 15:505,47953,066,73643,784,0001,151,0002,117,632stderr
8Aug 19, 2026 15:505,49453,982,57743,895,0001,157,0002,117,632stderr
9Aug 19, 2026 15:505,51454,216,76944,030,0001,190,0002,117,632stderr