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 25, 2026 15:55Zhou180Zhou180Score: 5,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:555,05750,605,09239,228,0002,241,0002,117,632
2Jun 25, 2026 15:555,07950,872,12539,387,0002,268,0002,117,632
3Jun 25, 2026 15:555,10150,966,37739,626,0002,210,0002,117,632
4Jun 25, 2026 15:555,12951,266,21139,736,0002,327,0002,117,632
5Jun 25, 2026 15:555,13951,339,98139,895,0002,251,0002,117,632
6Jun 25, 2026 15:555,14051,306,39239,881,0002,267,0002,117,632
7Jun 25, 2026 15:555,18251,705,94440,224,0002,276,0002,117,632
8Jun 25, 2026 15:555,31952,753,05041,512,0002,105,0002,117,632
9Jun 25, 2026 15:555,33552,855,83241,546,0002,208,0002,117,632