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:22Pavel SkripkinPavel SkripkinScore: 24,637Success
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:234,02841,971,59629,781,0003,249,0002,117,632
2May 11, 2026 18:234,10041,046,72730,307,0003,317,0002,117,632
3May 11, 2026 18:234,24545,251,37231,601,0003,216,0002,117,632
4May 11, 2026 18:2324,531208,514,384199,147,0002,010,0002,117,632
5May 11, 2026 18:2324,637209,347,190198,763,0003,263,0002,117,632
6May 11, 2026 18:2324,874211,307,137200,665,0003,307,0002,117,632
7May 11, 2026 18:2325,197216,072,314203,540,0003,082,0002,117,632
8May 11, 2026 18:2325,662217,748,575207,304,0003,126,0002,117,632
9May 11, 2026 18:2325,758221,546,110207,970,0003,247,0002,117,632