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:30Zhou180Zhou180Score: 3,602Success
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:313,54838,298,00728,051,0001,047,0002,117,632
2Jun 26, 2026 07:313,55838,419,22028,139,0001,041,0002,117,632
3Jun 26, 2026 07:313,59238,647,03128,391,0001,071,0002,117,632
4Jun 26, 2026 07:313,59538,644,65828,442,0001,042,0002,117,632
5Jun 26, 2026 07:313,60238,730,05427,440,0002,104,0002,117,632
6Jun 26, 2026 07:3121,337184,136,741172,952,0002,012,0002,117,632
7Jun 26, 2026 07:3121,448185,111,390172,859,0003,016,0002,117,632
8Jun 26, 2026 07:3121,870188,516,227177,324,0002,013,0002,117,632
9Jun 26, 2026 07:3122,470193,442,359182,243,0002,011,0002,117,632