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 1, 2026 17:47Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 17:470118,568,360100,915,0003,996,0002,420,736expected "2228218042 ", got "2228218043 "
2May 1, 2026 17:470123,436,862101,395,0003,011,0002,326,528expected "2122408040 ", got "2122408041 "
3May 1, 2026 17:4712,786117,542,827101,858,0002,995,0002,428,928