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 13:03Valentin KofmanValentin KofmanScore: 20,232Success
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 13:0320,049189,745,061164,401,00002,404,352
2Jul 6, 2025 13:0320,232190,389,125163,902,0001,998,0002,400,256
3Jul 6, 2025 13:0320,614196,121,271167,034,0002,000,0002,400,256