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:52Zhou180Zhou180Score: 3,739Success
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:533,60538,666,84428,521,0001,046,0002,117,632
2Jun 26, 2026 08:533,60938,735,05528,541,0001,055,0002,117,632
3Jun 26, 2026 08:533,63238,920,30828,725,0001,058,0002,117,632
4Jun 26, 2026 08:533,66139,124,95128,974,0001,053,0002,117,632
5Jun 26, 2026 08:533,73939,800,88128,551,0002,115,0002,117,632
6Jun 26, 2026 08:533,91042,537,88129,769,0002,301,0002,117,632
7Jun 26, 2026 08:533,91241,655,04829,780,0002,301,0002,117,632
8Jun 26, 2026 08:5322,112190,492,507178,285,0003,037,0002,117,632
9Jun 26, 2026 08:5322,562194,187,668182,006,0003,010,0002,117,632