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 29, 2026 13:18Victor MerckléVictor MerckléScore: 5,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:202,73030,793,79221,275,0001,112,0002,117,632stderr
2Aug 29, 2026 13:202,75831,670,84021,593,0001,029,0002,117,632stderr
3Aug 29, 2026 13:202,76631,038,62821,667,0001,017,0002,117,632stderr
4Aug 29, 2026 13:205,34451,919,39542,798,0001,024,0002,117,632stderr
5Aug 29, 2026 13:205,34452,536,14042,773,0001,055,0002,117,632stderr
6Aug 29, 2026 13:205,35752,263,52542,749,0001,180,0002,117,632stderr
7Aug 29, 2026 13:205,36152,122,89442,917,0001,044,0002,117,632stderr
8Aug 29, 2026 13:205,37552,209,25142,926,0001,156,0002,117,632stderr
9Aug 29, 2026 13:205,37552,213,53042,953,0001,125,0002,117,632stderr