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 07:34Zhou180Zhou180Score: 3,603Success
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 07:353,53038,114,01727,887,0001,063,0002,117,632
2Jun 26, 2026 07:353,55938,377,11028,146,0001,044,0002,117,632
3Jun 26, 2026 07:353,57238,425,99628,243,0001,053,0002,117,632
4Jun 26, 2026 07:353,57938,595,53428,295,0001,058,0002,117,632
5Jun 26, 2026 07:353,60338,764,23928,485,0001,063,0002,117,632
6Jun 26, 2026 07:353,60538,751,73428,521,0001,047,0002,117,632
7Jun 26, 2026 07:3521,991189,492,814178,316,0002,011,0002,117,632
8Jun 26, 2026 07:3522,053190,061,147178,830,0002,011,0002,117,632
9Jun 26, 2026 07:3522,129190,648,451179,452,0002,013,0002,117,632