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:03Zhou180Zhou180Score: 21,565Success
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:043,49037,839,14527,584,0001,034,0002,117,632
2Jun 26, 2026 09:043,50037,868,52427,653,0001,047,0002,117,632
3Jun 26, 2026 09:043,51537,950,15227,775,0001,050,0002,117,632
4Jun 26, 2026 09:043,51537,963,88727,796,0001,032,0002,117,632
5Jun 26, 2026 09:0421,565185,978,568173,826,0003,007,0002,117,632
6Jun 26, 2026 09:0421,861188,355,831177,256,0002,011,0002,117,632
7Jun 26, 2026 09:0421,922188,893,482177,749,0002,013,0002,117,632
8Jun 26, 2026 09:0421,930189,049,613176,820,0003,010,0002,117,632
9Jun 26, 2026 09:0422,055190,051,480178,841,0002,013,0002,117,632