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 09:20Zhou180Zhou180Score: 3,488Success
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 09:203,43937,319,50627,149,0001,056,0002,121,728stderr
2Jun 26, 2026 09:203,46237,489,04127,334,0001,057,0002,121,728stderr
3Jun 26, 2026 09:203,46537,601,00327,381,0001,032,0002,121,728stderr
4Jun 26, 2026 09:203,48537,681,52627,516,0001,061,0002,121,728stderr
5Jun 26, 2026 09:203,48837,718,10627,572,0001,034,0002,121,728stderr
6Jun 26, 2026 09:203,51638,020,49527,792,0001,041,0002,121,728stderr
7Jun 26, 2026 09:2022,410192,948,725181,757,0002,012,0002,121,728stderr
8Jun 26, 2026 09:2022,487193,473,588182,390,0002,011,0002,121,728stderr
9Jun 26, 2026 09:2022,785196,046,906184,826,0002,011,0002,121,728stderr