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 listSep 8, 2026 07:18Victor MerckléVictor MerckléScore: 2,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 07:192,61129,785,37820,317,0001,094,0002,117,632stderr
2Sep 8, 2026 07:192,61129,909,43920,330,0001,087,0002,117,632stderr
3Sep 8, 2026 07:192,61129,703,62120,331,0001,082,0002,117,632stderr
4Sep 8, 2026 07:192,62029,773,41820,402,0001,086,0002,117,632stderr
5Sep 8, 2026 07:192,62229,757,01420,383,0001,118,0002,117,632stderr
6Sep 8, 2026 07:192,62430,709,59220,503,0001,015,0002,117,632stderr
7Sep 8, 2026 07:192,62430,682,66820,410,0001,111,0002,117,632stderr
8Sep 8, 2026 07:192,62629,993,94920,415,0001,124,0002,117,632stderr
9Sep 8, 2026 07:192,63329,912,84520,579,0001,017,0002,117,632stderr