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 21:32Valentin KofmanValentin KofmanScore: 9,359Success
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 21:329,32096,246,35175,419,0001,005,0002,510,848
2Jul 7, 2025 21:329,322104,497,82776,444,00002,326,528
3Jul 7, 2025 21:329,330107,558,64175,499,0001,006,0002,510,848
4Jul 7, 2025 21:329,342109,136,97176,607,00002,510,848
5Jul 7, 2025 21:329,359108,333,25274,753,0001,993,0002,510,848
6Jul 7, 2025 21:329,360101,024,04375,757,000996,0002,510,848
7Jul 7, 2025 21:329,361101,894,93475,763,000996,0002,510,848
8Jul 7, 2025 21:329,367102,245,72375,812,000997,0002,445,312
9Jul 7, 2025 21:329,369101,315,12074,827,0001,995,0002,510,848