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 26, 2026 07:28Zhou180Zhou180Score: 21,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:283,60638,728,96228,506,0001,070,0002,117,632
2Jun 26, 2026 07:283,62840,081,75628,694,0001,059,0002,117,632
3Jun 26, 2026 07:283,68739,384,27729,192,0001,049,0002,117,632
4Jun 26, 2026 07:2821,524185,660,929174,491,0002,010,0002,117,632
5Jun 26, 2026 07:2821,738187,457,643176,243,0002,012,0002,117,632
6Jun 26, 2026 07:2821,889188,652,422177,484,0002,010,0002,117,632
7Jun 26, 2026 07:2821,911188,843,101176,663,0003,010,0002,117,632
8Jun 26, 2026 07:2821,977189,322,795178,205,0002,012,0002,117,632
9Jun 26, 2026 07:2822,252191,699,447180,460,0002,012,0002,117,632