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 7, 2025 09:26Valentin KofmanValentin KofmanScore: 14,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2025 09:2614,530142,391,274119,145,00002,392,064
2Jul 7, 2025 09:2614,548145,924,853119,291,00002,273,280
3Jul 7, 2025 09:2614,549145,152,094118,301,0001,002,0002,387,968
4Jul 7, 2025 09:2614,553144,930,070118,332,0001,002,0002,273,280
5Jul 7, 2025 09:2614,555142,710,726119,353,00002,273,280
6Jul 7, 2025 09:2614,557150,949,972118,366,0001,003,0002,392,064
7Jul 7, 2025 09:2614,559146,340,041118,384,0001,003,0002,273,280
8Jul 7, 2025 09:2614,566147,969,340119,443,00002,273,280
9Jul 7, 2025 09:2614,573147,134,978119,501,00002,392,064