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:07Valentin KofmanValentin KofmanScore: 20,988Success
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:0720,946194,835,117169,763,0001,997,0002,396,160
2Jul 7, 2025 09:0720,988200,967,296171,101,0001,000,0002,269,184
3Jul 7, 2025 09:0721,011199,955,379172,294,00002,269,184