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 listMay 11, 2026 18:18Pavel SkripkinPavel SkripkinScore: 24,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:194,06040,764,58729,919,0003,381,0002,117,632
2May 11, 2026 18:194,17844,459,83230,632,0003,628,0002,117,632
3May 11, 2026 18:194,21341,894,81931,474,0003,078,0002,117,632
4May 11, 2026 18:1924,492210,081,421196,820,0004,015,0002,117,632
5May 11, 2026 18:1924,708210,538,149198,974,0003,639,0002,117,632
6May 11, 2026 18:1924,879213,030,998200,500,0003,514,0002,117,632
7May 11, 2026 18:1925,022212,521,798201,896,0003,290,0002,117,632
8May 11, 2026 18:1925,049212,765,927202,393,0003,013,0002,117,632
9May 11, 2026 18:1925,449218,795,988205,181,0003,504,0002,117,632