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 listMar 24, 2026 05:29Dominique GarmierDominique GarmierScore: 18,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 05:293,68655,495,80128,209,0002,014,0002,441,216
2Mar 24, 2026 05:293,74556,784,46029,717,000990,0002,424,832
3Mar 24, 2026 05:293,76158,306,13729,849,000994,0002,342,912
4Mar 24, 2026 05:2918,757178,024,679149,814,0003,995,0002,297,856
5Mar 24, 2026 05:2918,788181,737,514152,065,0002,000,0002,379,776
6Mar 24, 2026 05:2918,941178,662,195155,319,00002,424,832
7Mar 24, 2026 05:2918,992184,543,915151,744,0003,993,0002,486,272
8Mar 24, 2026 05:2919,021180,421,718152,973,0002,999,0002,506,752
9Mar 24, 2026 05:2919,026179,866,748153,010,0003,000,0002,351,104