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 14:48Victor MerckléVictor MerckléScore: 5,490Success
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 14:492,79132,474,61221,827,0001,065,0002,117,632stderr
2Aug 19, 2026 14:492,79431,956,62021,749,0001,162,0002,117,632stderr
3Aug 19, 2026 14:492,82331,330,86821,952,0001,198,0002,117,632stderr
4Aug 19, 2026 14:492,97032,735,40123,310,0001,048,0002,117,632stderr
5Aug 19, 2026 14:495,49053,136,16544,003,0001,017,0002,117,632stderr
6Aug 19, 2026 14:495,50053,452,19744,088,0001,017,0002,117,632stderr
7Aug 19, 2026 14:495,56754,698,96844,631,0001,021,0002,117,632stderr
8Aug 19, 2026 14:495,59554,032,72244,862,0001,021,0002,117,632stderr
9Aug 19, 2026 14:495,69763,144,91845,696,0001,023,0002,117,632stderr