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 listJul 2, 2026 14:49Victor MerckléVictor MerckléScore: 3,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:502,94732,074,93523,056,0001,111,0002,117,632stderr
2Jul 2, 2026 14:502,97932,353,11223,405,0001,023,0002,117,632stderr
3Jul 2, 2026 14:502,99732,833,39423,565,0001,018,0002,117,632stderr
4Jul 2, 2026 14:503,00132,543,33923,581,0001,035,0002,117,632stderr
5Jul 2, 2026 14:503,03332,758,82623,740,0001,137,0002,117,632stderr
6Jul 2, 2026 14:503,03932,853,22123,878,0001,042,0002,117,632stderr
7Jul 2, 2026 14:503,19134,147,09624,926,0001,242,0002,117,632stderr
8Jul 2, 2026 14:5011,909105,548,74996,537,0001,120,0002,117,632stderr
9Jul 2, 2026 14:5011,927105,659,00196,691,0001,115,0002,117,632stderr