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 8, 2026 07:01Rajarshi BasuRajarshi BasuScore: 78,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 07:016,11982,198,40346,165,0004,014,0002,416,640
2Jan 8, 2026 07:026,34781,871,26546,042,0006,005,0002,269,184
3Jan 8, 2026 07:0275,837654,296,183502,889,000118,973,0002,273,280
4Jan 8, 2026 07:0178,840676,040,302526,580,000119,904,0002,396,160
5Jan 8, 2026 07:0285,491726,859,747585,024,000116,004,0002,416,640
6Jan 8, 2026 07:0196,537818,182,954663,670,000127,936,0002,482,176