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:09Zhou180Zhou180Score: 21,918Success
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:0921,580186,083,125174,946,0002,010,0002,117,632
2Jun 26, 2026 09:0921,787187,825,405176,643,0002,014,0002,117,632
3Jun 26, 2026 09:0921,860188,432,434177,243,0002,012,0002,117,632
4Jun 26, 2026 09:0921,901188,775,101177,579,0002,011,0002,117,632
5Jun 26, 2026 09:0921,918188,845,808177,719,0002,011,0002,117,632
6Jun 26, 2026 09:0921,946189,124,123177,955,0002,010,0002,117,632
7Jun 26, 2026 09:0922,175190,932,940179,825,0002,012,0002,117,632
8Jun 26, 2026 09:0922,517193,834,131182,630,0002,011,0002,117,632
9Jun 26, 2026 09:0922,789196,001,579184,858,0002,013,0002,117,632