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 7, 2026 16:02Victor MerckléVictor MerckléScore: 3,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:033,38936,869,38526,735,0001,059,0002,113,536
2Jun 7, 2026 16:033,39336,925,45926,788,0001,037,0002,113,536
3Jun 7, 2026 16:033,40037,028,05826,813,0001,071,0002,113,536
4Jun 7, 2026 16:033,41443,493,62426,934,0001,064,0002,113,536
5Jun 7, 2026 16:033,47637,659,83127,446,0001,060,0002,113,536
6Jun 7, 2026 16:033,50446,166,03726,667,0002,070,0002,113,536
7Jun 7, 2026 16:033,50537,877,53927,678,0001,065,0002,113,536
8Jun 7, 2026 16:033,57138,451,86727,216,0002,071,0002,113,536
9Jun 7, 2026 16:033,60148,315,43527,371,0002,165,0002,117,632