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 listApr 30, 2026 06:09olliecrowolliecrowScore: 24,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 06:104,31054,178,12833,326,0002,019,0002,314,240
2Apr 30, 2026 06:104,43852,050,59534,373,0002,021,0002,334,720
3Apr 30, 2026 06:104,49257,351,48633,855,0002,987,0002,478,080
4Apr 30, 2026 06:104,50757,122,40634,965,0001,998,0002,482,176
5Apr 30, 2026 06:1024,787221,923,643199,252,0004,005,0002,314,240
6Apr 30, 2026 06:1024,896221,355,056202,148,0002,001,0002,498,560
7Apr 30, 2026 06:1024,987221,859,806200,902,0003,998,0002,318,336
8Apr 30, 2026 06:1025,193227,681,531202,598,0003,992,0002,551,808
9Apr 30, 2026 06:1025,303227,227,705205,483,0002,004,0002,514,944