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 09:05Valentin KofmanValentin KofmanScore: 28,133Success
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 09:0527,496252,245,975224,465,0001,002,0002,400,256
2Jul 6, 2025 09:0527,597251,756,618225,295,0001,001,0002,404,352
3Jul 6, 2025 09:0527,770252,401,692224,715,0002,996,0002,281,472
4Jul 6, 2025 09:0528,048258,562,273227,997,0001,999,0002,392,064
5Jul 6, 2025 09:0528,133259,599,953229,695,000998,0002,400,256
6Jul 6, 2025 09:0528,197254,216,461230,217,0001,000,0002,400,256
7Jul 6, 2025 09:0528,238262,918,158230,550,0001,002,0002,404,352
8Jul 6, 2025 09:0528,620260,060,135233,688,000998,0002,396,160
9Jul 6, 2025 09:0530,327278,080,837247,683,000998,0002,392,064