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 listJun 26, 2026 07:50Zhou180Zhou180Score: 21,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:503,53138,106,11027,916,0001,046,0002,117,632
2Jun 26, 2026 07:503,55038,318,72128,084,0001,031,0002,117,632
3Jun 26, 2026 07:503,55338,330,26028,082,0001,058,0002,117,632
4Jun 26, 2026 07:5021,450186,453,218172,855,0003,040,0002,117,632
5Jun 26, 2026 07:5021,474185,349,487173,089,0003,004,0002,117,632
6Jun 26, 2026 07:5021,631186,557,593175,370,0002,011,0002,117,632
7Jun 26, 2026 07:5021,687187,030,944175,824,0002,013,0002,117,632
8Jun 26, 2026 07:5021,710187,196,891174,996,0003,028,0002,117,632
9Jun 26, 2026 07:5022,205191,212,146180,073,0002,011,0002,117,632