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 23, 2026 13:42Victor MerckléVictor MerckléScore: 3,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 13:433,19333,606,59425,135,0001,050,0002,113,536
2Jun 23, 2026 13:433,22233,844,85225,392,0001,029,0002,113,536
3Jun 23, 2026 13:433,22333,861,94725,363,0001,066,0002,113,536
4Jun 23, 2026 13:433,22733,954,49525,401,0001,066,0002,113,536
5Jun 23, 2026 13:433,23233,980,62625,436,0001,071,0002,113,536
6Jun 23, 2026 13:433,25734,125,85325,674,0001,036,0002,113,536
7Jun 23, 2026 13:433,26834,259,13625,733,0001,071,0002,113,536
8Jun 23, 2026 13:433,28434,444,58425,880,0001,052,0002,113,536
9Jun 23, 2026 13:4312,130106,924,07698,461,0001,013,0002,113,536