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 listJul 6, 2025 15:16Valentin KofmanValentin KofmanScore: 16,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 15:1615,833156,396,885127,831,0001,997,0002,359,296
2Jul 6, 2025 15:1616,085154,592,001128,898,0002,997,0002,359,296
3Jul 6, 2025 15:1616,087160,084,182129,915,0001,998,0002,277,376
4Jul 6, 2025 15:1616,176158,427,264131,648,000997,0002,359,296
5Jul 6, 2025 15:1616,223158,193,950131,029,0002,000,0002,355,200
6Jul 6, 2025 15:1616,255153,271,724132,288,0001,002,0002,367,488
7Jul 6, 2025 15:1616,460155,192,225132,972,0001,999,0002,387,968
8Jul 6, 2025 15:1616,542165,150,363134,647,000997,0002,273,280
9Jul 6, 2025 15:1616,731165,168,214136,191,0001,001,0002,359,296