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 13:53Victor MerckléVictor MerckléScore: 5,520Success
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 13:542,89632,369,24822,713,0001,036,0002,117,632stderr
2Aug 23, 2026 13:542,89731,977,92422,720,0001,037,0002,117,632stderr
3Aug 23, 2026 13:542,90132,084,37722,761,0001,035,0002,117,632stderr
4Aug 23, 2026 13:542,91532,179,53122,851,0001,056,0002,117,632stderr
5Aug 23, 2026 13:545,52053,492,77843,116,0002,150,0002,117,632stderr
6Aug 23, 2026 13:545,53653,630,08643,258,0002,141,0002,117,632stderr
7Aug 23, 2026 13:545,54553,728,76543,331,0002,144,0002,117,632stderr
8Aug 23, 2026 13:545,55853,835,64943,415,0002,163,0002,117,632stderr
9Aug 23, 2026 13:545,58254,039,57543,562,0002,214,0002,117,632stderr