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 21, 2026 19:19A_ShamanA_ShamanScore: 36,120Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 19:2035,615301,138,419111,097,000180,949,0002,113,536
2Jun 21, 2026 19:2035,647301,381,775111,543,000180,767,0002,113,536
3Jun 21, 2026 19:2035,815302,724,671109,551,000184,137,0002,113,536
4Jun 21, 2026 19:2035,877303,360,335112,225,000181,974,0002,113,536
5Jun 21, 2026 19:2036,120305,280,758110,244,000185,941,0002,113,536
6Jun 21, 2026 19:2036,156305,610,186113,233,000183,253,0002,113,536
7Jun 21, 2026 19:2036,233306,316,306114,646,000182,468,0002,113,536
8Jun 21, 2026 19:2036,461308,786,252110,602,000188,385,0002,113,536
9Jun 21, 2026 19:2037,358315,481,757122,471,000183,865,0002,113,536