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 08:32Zhou180Zhou180Score: 21,911Success
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 08:333,45237,482,28527,274,0001,033,0002,117,632
2Jun 26, 2026 08:333,45437,508,53327,269,0001,057,0002,117,632
3Jun 26, 2026 08:333,51338,043,00327,769,0001,042,0002,117,632
4Jun 26, 2026 08:3321,893188,700,493176,486,0003,042,0002,117,632
5Jun 26, 2026 08:3321,911188,916,302177,661,0002,010,0002,117,632
6Jun 26, 2026 08:3321,955189,279,892177,027,0003,010,0002,117,632
7Jun 26, 2026 08:3322,003189,688,321178,420,0002,011,0002,117,632
8Jun 26, 2026 08:3322,074190,154,346178,996,0002,013,0002,117,632
9Jun 26, 2026 08:3322,112190,422,978178,295,0003,030,0002,117,632