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:53Victor MerckléVictor MerckléScore: 2,802Success
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:542,75030,813,29521,458,0001,094,0002,117,632stderr
2Aug 19, 2026 14:542,75430,903,15321,573,0001,015,0002,117,632stderr
3Aug 19, 2026 14:542,75930,959,08821,611,0001,017,0002,117,632stderr
4Aug 19, 2026 14:542,76230,794,82221,635,0001,016,0002,117,632stderr
5Aug 19, 2026 14:542,80231,474,92521,898,0001,084,0002,117,632stderr
6Aug 19, 2026 14:545,39452,434,91743,198,0001,037,0002,117,632stderr
7Aug 19, 2026 14:545,41352,700,56243,341,0001,049,0002,117,632stderr
8Aug 19, 2026 14:545,42552,759,90143,455,0001,031,0002,117,632stderr
9Aug 19, 2026 14:545,44152,938,35843,450,0001,172,0002,117,632stderr