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:01Victor MerckléVictor MerckléScore: 5,487Success
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:022,84431,548,86622,307,0001,017,0002,117,632stderr
2Aug 19, 2026 13:022,85231,753,54722,365,0001,022,0002,117,632stderr
3Aug 19, 2026 13:022,85431,525,76322,385,0001,020,0002,117,632stderr
4Aug 19, 2026 13:025,47154,485,42943,728,0001,141,0002,117,632stderr
5Aug 19, 2026 13:025,48753,264,02643,846,0001,155,0002,117,632stderr
6Aug 19, 2026 13:025,50953,297,89844,031,0001,149,0002,117,632stderr
7Aug 19, 2026 13:025,54453,740,66344,320,0001,144,0002,117,632stderr
8Aug 19, 2026 13:025,55753,744,64144,373,0001,196,0002,117,632stderr
9Aug 19, 2026 13:025,63254,511,40145,055,0001,134,0002,117,632stderr