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 5, 2026 04:34Victor MerckléVictor MerckléScore: 3,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 04:353,41037,053,29025,873,0002,089,0002,113,536
2Jun 5, 2026 04:353,41237,516,39326,917,0001,068,0002,113,536
3Jun 5, 2026 04:353,41337,141,52726,922,0001,069,0002,113,536
4Jun 5, 2026 04:353,42037,513,59825,980,0002,069,0002,113,536
5Jun 5, 2026 04:353,42337,203,20627,039,0001,036,0002,113,536
6Jun 5, 2026 04:353,42637,173,59627,045,0001,052,0002,113,536
7Jun 5, 2026 04:353,51337,973,86026,783,0002,029,0002,113,536
8Jun 5, 2026 04:353,54738,174,75128,053,0001,035,0002,113,536
9Jun 5, 2026 04:3512,849114,448,980103,334,0002,033,0002,113,536