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 25, 2026 15:34Zhou180Zhou180Score: 23,382Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:3522,954197,425,045186,214,0002,010,0002,117,632
2Jun 25, 2026 15:3522,989197,677,257186,501,0002,010,0002,117,632
3Jun 25, 2026 15:3523,183199,254,610188,097,0002,010,0002,117,632
4Jun 25, 2026 15:3523,218199,538,588188,380,0002,011,0002,117,632
5Jun 25, 2026 15:3523,382200,874,254189,726,0002,009,0002,117,632
6Jun 25, 2026 15:3523,422201,248,696190,056,0002,009,0002,117,632
7Jun 25, 2026 15:3523,422201,190,356190,055,0002,011,0002,117,632
8Jun 25, 2026 15:3523,478201,767,321190,512,0002,011,0002,117,632
9Jun 25, 2026 15:3523,694203,404,151192,282,0002,009,0002,117,632