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 listJun 29, 2026 14:24Victor MerckléVictor MerckléScore: 3,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 14:253,36236,933,25426,511,0001,065,0002,113,536
2Jun 29, 2026 14:253,38437,192,50226,688,0001,067,0002,113,536
3Jun 29, 2026 14:253,42737,466,29326,046,0002,056,0002,113,536
4Jun 29, 2026 14:253,43437,535,45426,130,0002,030,0002,113,536
5Jun 29, 2026 14:253,43438,290,41626,043,0002,120,0002,113,536
6Jun 29, 2026 14:253,43837,567,56226,135,0002,059,0002,113,536
7Jun 29, 2026 14:253,44237,646,05426,018,0002,208,0002,113,536
8Jun 29, 2026 14:2513,455120,378,190108,308,0002,023,0002,125,824stderr
9Jun 29, 2026 14:2513,540120,407,979109,004,0002,030,0002,125,824stderr