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:21Zhou180Zhou180Score: 21,641Success
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:213,48237,714,52527,522,0001,035,0002,117,632
2Jun 26, 2026 08:213,48837,791,51227,556,0001,052,0002,117,632
3Jun 26, 2026 08:2120,998181,326,818170,179,0002,011,0002,117,632
4Jun 26, 2026 08:2121,215183,177,905171,959,0002,010,0002,117,632
5Jun 26, 2026 08:2121,641186,604,539175,452,0002,011,0002,117,632
6Jun 26, 2026 08:2121,662186,803,804175,623,0002,012,0002,117,632
7Jun 26, 2026 08:2121,736187,455,312175,222,0003,019,0002,117,632
8Jun 26, 2026 08:2121,975189,415,391177,166,0003,037,0002,117,632
9Jun 26, 2026 08:2122,040189,982,879178,724,0002,010,0002,117,632