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 10, 2026 09:10Pavel SkripkinPavel SkripkinScore: 24,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 09:104,13448,555,56730,772,0003,127,0002,404,352
2May 10, 2026 09:104,13448,838,66230,736,0003,165,0002,465,792
3May 10, 2026 09:104,20549,773,06631,225,0003,260,0002,506,752
4May 10, 2026 09:104,29152,715,64532,063,0003,128,0002,318,336
5May 10, 2026 09:1024,618218,297,824198,696,0003,177,0002,416,640
6May 10, 2026 09:1025,050222,078,909202,173,0003,244,0002,535,424
7May 10, 2026 09:1025,093221,176,164201,747,0004,019,0002,555,904
8May 10, 2026 09:1025,463222,030,899204,751,0004,052,0002,347,008
9May 10, 2026 09:1025,500222,497,100204,766,0004,341,0002,342,912