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 11:32Valentin KofmanValentin KofmanScore: 17,225Success
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 11:3216,953167,507,690137,014,0002,000,0002,400,256
2Jul 6, 2025 11:3217,180165,353,476139,877,000999,0002,383,872
3Jul 6, 2025 11:3217,196163,605,890139,009,0002,000,0002,392,064
4Jul 6, 2025 11:3217,216171,440,246140,168,0001,001,0002,387,968
5Jul 6, 2025 11:3217,225163,699,773139,241,0002,003,0002,392,064
6Jul 6, 2025 11:3217,231169,434,614140,293,0001,002,0002,387,968
7Jul 6, 2025 11:3217,233168,414,154141,314,00002,392,064
8Jul 6, 2025 11:3217,254170,618,141140,477,0001,003,0002,396,160
9Jul 6, 2025 11:3217,275171,617,777139,664,0001,995,0002,383,872