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 09:11Zhou180Zhou180Score: 21,700Success
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 09:113,51637,956,30527,807,0001,030,0002,117,632
2Jun 26, 2026 09:113,52838,105,18527,886,0001,047,0002,117,632
3Jun 26, 2026 09:113,55938,303,15228,153,0001,031,0002,117,632
4Jun 26, 2026 09:1121,663186,763,279175,628,0002,011,0002,117,632
5Jun 26, 2026 09:1121,700186,999,958175,931,0002,011,0002,117,632
6Jun 26, 2026 09:1121,707187,136,415175,990,0002,012,0002,117,632
7Jun 26, 2026 09:1121,924188,990,861177,766,0002,011,0002,117,632
8Jun 26, 2026 09:1122,085190,243,033179,089,0002,014,0002,117,632
9Jun 26, 2026 09:1122,243191,567,692179,388,0003,007,0002,117,632