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 3, 2026 13:41Victor MerckléVictor MerckléScore: 3,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 13:413,23734,835,76125,476,0001,074,0002,117,632stderr
2Aug 3, 2026 13:413,27835,206,74224,870,0002,015,0002,117,632stderr
3Aug 3, 2026 13:413,29535,216,88925,975,0001,047,0002,117,632stderr
4Aug 3, 2026 13:413,31135,399,03226,105,0001,048,0002,117,632stderr
5Aug 3, 2026 13:413,39236,003,55426,744,0001,072,0002,117,632stderr
6Aug 3, 2026 13:413,40236,171,50726,864,0001,036,0002,117,632stderr
7Aug 3, 2026 13:413,41236,347,11326,948,0001,037,0002,117,632stderr
8Aug 3, 2026 13:4112,097107,495,95896,973,0002,223,0002,117,632stderr
9Aug 3, 2026 13:4112,229108,644,76198,109,0002,175,0002,117,632stderr