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 28, 2026 06:41Victor MerckléVictor MerckléScore: 17,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 06:428,44077,043,24868,026,0001,185,0002,117,632stderr
2Jun 28, 2026 06:428,45377,149,71768,166,0001,152,0002,117,632stderr
3Jun 28, 2026 06:428,47077,349,77068,275,0001,184,0002,117,632stderr
4Jun 28, 2026 06:428,80880,010,20371,212,0001,017,0002,117,632stderr
5Jun 28, 2026 06:4217,324149,964,334141,053,0001,005,0002,117,632stderr
6Jun 28, 2026 06:4217,339150,115,720141,175,0001,005,0002,117,632stderr
7Jun 28, 2026 06:4217,422150,680,596141,857,0001,008,0002,117,632stderr
8Jun 28, 2026 06:4217,510151,407,576142,582,0001,006,0002,117,632stderr
9Jun 28, 2026 06:4217,668152,986,299143,876,0001,008,0002,117,632stderr