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 22, 2026 20:00Dominique GarmierDominique GarmierScore: 18,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 15:5717,961173,957,081147,284,00002,416,640
2Mar 22, 2026 20:0917,980177,181,001145,429,0002,005,0002,375,680
3Mar 22, 2026 20:0917,984168,884,803145,459,0002,006,0002,367,488
4Mar 22, 2026 20:0017,985175,202,110147,481,00002,400,256
5Mar 22, 2026 15:5717,997180,681,491147,576,00002,359,296
6Mar 22, 2026 15:5718,015177,938,603147,721,00002,351,104
7Mar 22, 2026 19:2718,016176,876,384146,732,000998,0002,404,352
8Mar 22, 2026 20:0918,019172,687,108145,758,0001,996,0002,396,160
9Mar 22, 2026 19:2718,025170,276,548145,808,0001,997,0002,371,584
10Mar 22, 2026 20:0018,038178,094,762145,914,0001,998,0002,334,720
11Mar 22, 2026 20:0018,047175,627,559145,986,0001,999,0002,318,336
12Mar 22, 2026 19:2718,089175,981,371144,319,0004,008,0002,387,968