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 23, 2026 15:28Victor MerckléVictor MerckléScore: 2,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:292,76931,001,24121,694,0001,018,0002,117,632stderr
2Aug 23, 2026 15:292,77030,911,69321,705,0001,014,0002,117,632stderr
3Aug 23, 2026 15:292,77430,897,27121,738,0001,011,0002,117,632stderr
4Aug 23, 2026 15:292,77531,002,81621,737,0001,024,0002,117,632stderr
5Aug 23, 2026 15:292,78330,942,80821,680,0001,146,0002,117,632stderr
6Aug 23, 2026 15:292,80431,608,11021,974,0001,024,0002,117,632stderr
7Aug 23, 2026 15:292,92840,265,34022,811,0001,200,0002,117,632stderr
8Aug 23, 2026 15:295,43552,800,00143,439,0001,131,0002,117,632stderr
9Aug 23, 2026 15:295,44553,140,47343,518,0001,135,0002,117,632stderr