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:46Josu San MartinJosu San MartinScore: 3,800Success
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 04:473,72340,587,23628,430,0002,104,0002,113,536
2Sep 3, 2026 04:473,72540,537,28228,411,0002,136,0002,113,536
3Sep 3, 2026 04:473,76941,735,56528,721,0002,190,0002,113,536
4Sep 3, 2026 04:473,79241,161,83428,941,0002,156,0002,113,536
5Sep 3, 2026 04:473,80041,197,47328,995,0002,169,0002,113,536
6Sep 3, 2026 04:473,81341,379,48029,127,0002,144,0002,113,536
7Sep 3, 2026 04:473,82441,415,47529,213,0002,148,0002,113,536
8Sep 3, 2026 04:4710,59597,118,13181,285,0005,594,0002,113,536
9Sep 3, 2026 04:4719,065166,411,791149,888,0006,453,0002,117,632