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 16:58Victor MerckléVictor MerckléScore: 3,134Success
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 16:593,04732,651,05723,900,0001,086,0002,113,536
2Jun 23, 2026 16:593,05632,676,93323,861,0001,199,0002,113,536
3Jun 23, 2026 16:593,07132,827,15223,978,0001,212,0002,113,536
4Jun 23, 2026 16:593,08432,702,49024,052,0001,239,0002,113,536
5Jun 23, 2026 16:593,13433,386,85524,462,0001,242,0002,113,536
6Jun 23, 2026 16:5912,046106,375,06397,772,0001,010,0002,113,536
7Jun 23, 2026 16:5912,132107,126,49698,476,0001,012,0002,113,536
8Jun 23, 2026 16:5912,548110,578,140101,891,0001,010,0002,113,536
9Jun 23, 2026 16:5912,639111,629,790102,633,0001,008,0002,113,536