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 listJun 16, 2026 15:55Maya RebholzMaya RebholzScore: 31,470Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 15:5730,919262,714,220224,204,00029,337,0002,281,472
2Jun 16, 2026 15:5731,011263,536,670227,486,00026,812,0002,281,472
3Jun 16, 2026 15:5731,296265,943,030227,349,00029,283,0002,281,472
4Jun 16, 2026 15:5731,361267,416,996228,130,00029,031,0002,281,472
5Jun 16, 2026 15:5731,470267,231,819229,140,00028,919,0002,281,472
6Jun 16, 2026 15:5731,585268,345,338229,770,00029,232,0002,281,472
7Jun 16, 2026 15:5731,875270,554,308232,938,00028,438,0002,281,472
8Jun 16, 2026 15:5732,384275,204,737238,213,00027,338,0002,281,472
9Jun 16, 2026 15:5732,927279,718,990242,725,00027,278,0002,281,472