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:01Pavel SkripkinPavel SkripkinScore: 12,088Success
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:0112,062116,240,00095,913,0002,997,0002,420,736
2May 1, 2026 17:0112,070114,847,31194,976,0003,998,0002,416,640
3May 1, 2026 17:0112,080115,043,33396,063,0003,001,0002,420,736
4May 1, 2026 17:0112,082118,921,56797,075,0002,001,0002,412,544
5May 1, 2026 17:0112,088117,973,59496,119,0003,003,0002,416,640
6May 1, 2026 17:0112,093117,892,07697,160,0002,003,0002,424,832
7May 1, 2026 17:0112,123117,524,61096,399,0003,012,0002,416,640
8May 1, 2026 17:0112,129112,434,47298,456,0001,004,0002,424,832
9May 1, 2026 17:0112,141113,810,53398,557,0001,005,0002,326,528