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 21:16Valentin KofmanValentin KofmanScore: 15,576Success
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 21:1615,165150,961,679124,354,00002,359,296
2Jul 6, 2025 21:1615,327149,286,984123,689,0001,994,0002,359,296
3Jul 6, 2025 21:1615,407150,370,738125,338,0001,002,0002,359,296
4Jul 6, 2025 21:1615,543165,870,666127,452,00002,359,296
5Jul 6, 2025 21:1615,576156,819,407125,725,0001,995,0002,359,296
6Jul 6, 2025 21:1615,659157,575,676127,401,0001,003,0002,359,296
7Jul 6, 2025 21:1615,663154,428,265126,446,0001,991,0002,359,296
8Jul 6, 2025 21:1615,666154,156,052127,459,0001,003,0002,363,392
9Jul 6, 2025 21:1615,764156,127,481128,259,0001,002,0002,273,280