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 listSep 3, 2026 04:59Josu San MartinJosu San MartinScore: 3,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:003,58040,173,99728,293,0001,066,0002,113,536
2Sep 3, 2026 05:003,58339,474,97028,332,0001,050,0002,113,536
3Sep 3, 2026 05:003,60340,304,53828,516,0001,033,0002,113,536
4Sep 3, 2026 05:003,61140,350,05428,544,0001,067,0002,113,536
5Sep 3, 2026 05:003,62040,474,92828,635,0001,057,0002,113,536
6Sep 3, 2026 05:009,34486,700,93372,568,0004,056,0002,113,536
7Sep 3, 2026 05:0010,54498,632,35781,099,0005,367,0002,113,536
8Sep 3, 2026 05:0011,736106,342,66890,022,0006,216,0002,113,536
9Sep 3, 2026 05:0020,745180,916,172163,836,0006,275,0002,117,632