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 06:53Zhou180Zhou180Score: 21,719Success
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 06:543,87641,004,24329,606,0002,178,0002,117,632
2Jun 26, 2026 06:543,87941,049,99729,656,0002,153,0002,117,632
3Jun 26, 2026 06:543,88240,951,14329,636,0002,197,0002,117,632
4Jun 26, 2026 06:543,91741,340,27929,872,0002,249,0002,117,632
5Jun 26, 2026 06:5421,719187,334,682174,857,0003,244,0002,117,632
6Jun 26, 2026 06:5422,177191,075,067178,701,0003,157,0002,117,632
7Jun 26, 2026 06:5422,224191,602,994179,061,0003,181,0002,117,632
8Jun 26, 2026 06:5422,625195,053,395182,232,0003,293,0002,121,728
9Jun 26, 2026 06:5422,681195,730,508182,716,0003,273,0002,117,632