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 listMar 23, 2026 16:43Dominique GarmierDominique GarmierScore: 9,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 15:089,533107,715,79875,162,0003,006,0002,359,296
2Mar 23, 2026 16:439,640104,729,47977,044,0002,001,0002,523,136
3Mar 23, 2026 15:089,691104,646,37678,461,0001,005,0002,322,432
4Mar 23, 2026 15:089,700109,109,70578,536,0001,006,0002,469,888
5Mar 23, 2026 15:089,701107,199,87678,542,0001,006,0002,412,544
6Mar 23, 2026 15:089,748111,699,79575,938,0003,996,0002,269,184
7Mar 23, 2026 15:089,760103,427,59279,035,0001,000,0002,519,040
8Mar 23, 2026 15:089,772108,969,36677,124,0003,004,0002,293,760
9Mar 23, 2026 16:439,782107,488,10079,210,0001,002,0002,306,048
10Mar 23, 2026 15:089,811106,783,56280,454,00002,326,528
11Mar 23, 2026 16:439,851112,094,79376,793,0003,989,0002,306,048
12Mar 23, 2026 15:089,853105,895,41779,798,000997,0002,519,040