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 listJan 2, 2026 04:53Rajarshi BasuRajarshi BasuScore: 96,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:537,69487,404,07960,087,0003,004,0002,424,832
2Jan 2, 2026 04:527,70087,579,14358,132,0005,011,0002,338,816
3Jan 2, 2026 04:5273,173627,097,616466,012,000134,003,0002,285,568
4Jan 2, 2026 04:5396,683819,892,256680,826,000111,971,0002,371,584
5Jan 2, 2026 04:52101,494856,829,003716,353,000115,895,0002,510,848
6Jan 2, 2026 04:53110,129928,520,623780,188,000122,872,0002,498,560