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:37Zhou180Zhou180Score: 22,197Success
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:383,57038,409,84328,242,0001,034,0002,117,632
2Jun 26, 2026 07:3821,844188,385,216177,115,0002,012,0002,117,632
3Jun 26, 2026 07:3822,000189,639,497177,373,0003,029,0002,117,632
4Jun 26, 2026 07:3822,021199,519,975177,514,0003,064,0002,117,632
5Jun 26, 2026 07:3822,197191,155,279180,008,0002,012,0002,117,632
6Jun 26, 2026 07:3822,234201,745,147180,314,0002,010,0002,117,632
7Jun 26, 2026 07:3822,250191,645,938179,434,0003,022,0002,117,632
8Jun 26, 2026 07:3822,260191,664,961180,528,0002,010,0002,117,632
9Jun 26, 2026 07:3822,302192,099,369179,833,0003,044,0002,117,632