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:00Zhou180Zhou180Score: 21,989Success
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:023,54738,321,68528,039,0001,052,0002,117,632
2Jun 26, 2026 09:023,57138,437,37628,254,0001,035,0002,117,632
3Jun 26, 2026 09:023,61638,791,86628,627,0001,032,0002,117,632
4Jun 26, 2026 09:023,69839,495,38728,321,0002,008,0002,117,632
5Jun 26, 2026 09:0221,989189,514,776177,268,0003,045,0002,117,632
6Jun 26, 2026 09:0222,166191,041,184178,744,0003,022,0002,117,632
7Jun 26, 2026 09:0222,187191,046,830179,925,0002,012,0002,117,632
8Jun 26, 2026 09:0222,247191,588,698179,398,0003,028,0002,117,632
9Jun 26, 2026 09:0222,635194,769,749183,603,0002,011,0002,117,632