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 listApr 30, 2026 10:38Victor MerckléVictor MerckléScore: 11,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 10:3811,057105,988,47988,676,0001,992,0002,531,328
2Apr 30, 2026 10:3811,079106,021,50388,856,0001,996,0002,453,504
3Apr 30, 2026 10:3811,117112,947,92687,157,0004,007,0002,334,720
4Apr 30, 2026 10:3811,137107,454,61489,321,0002,007,0002,502,656
5Apr 30, 2026 10:3811,138112,577,53789,325,0002,007,0002,465,792
6Apr 30, 2026 10:3811,141107,176,23289,353,0002,007,0002,392,064
7Apr 30, 2026 10:3811,160105,377,07890,510,0001,005,0002,326,528
8Apr 30, 2026 10:3811,166107,412,85890,557,0001,006,0002,322,432
9Apr 30, 2026 10:3811,190111,597,96588,769,0002,992,0002,387,968