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 13:22Pavel SkripkinPavel SkripkinScore: 4,303Success
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 13:234,06643,590,81330,254,0003,089,0002,117,632
2May 10, 2026 13:234,13043,131,44230,660,0003,210,0002,117,632
3May 10, 2026 13:234,13141,889,61930,599,0003,281,0002,117,632
4May 10, 2026 13:234,15144,197,89830,846,0003,197,0002,117,632
5May 10, 2026 13:234,30347,260,23331,281,0004,007,0002,117,632
6May 10, 2026 13:2324,841214,287,388200,568,0003,136,0002,117,632
7May 10, 2026 13:2325,022212,480,515202,096,0003,086,0002,117,632
8May 10, 2026 13:2325,131215,144,513202,952,0003,123,0002,117,632
9May 10, 2026 13:2325,276214,482,175204,088,0003,179,0002,117,632