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 17:08Victor MerckléVictor MerckléScore: 12,147Success
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 17:113,03332,492,57523,753,0001,120,0002,113,536
2Jun 23, 2026 17:113,08332,966,16924,080,0001,204,0002,113,536
3Jun 23, 2026 17:113,10434,337,20724,279,0001,180,0002,113,536
4Jun 23, 2026 17:113,11433,258,84224,370,0001,170,0002,113,536
5Jun 23, 2026 17:1112,147107,272,44598,598,0001,009,0002,113,536
6Jun 23, 2026 17:1112,674111,552,928102,924,0001,009,0002,113,536
7Jun 23, 2026 17:1112,714111,877,278103,254,0001,008,0002,113,536
8Jun 23, 2026 17:1112,767112,336,187103,682,0001,009,0002,113,536
9Jun 23, 2026 17:1112,785112,268,731103,833,0001,008,0002,113,536