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:54Zhou180Zhou180Score: 5,642Success
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:545,56354,801,16943,389,0002,235,0002,117,632
2Jun 25, 2026 15:545,59855,055,40143,615,0002,289,0002,117,632
3Jun 25, 2026 15:545,60855,125,84843,710,0002,277,0002,117,632
4Jun 25, 2026 15:545,64155,356,91044,242,0002,017,0002,117,632
5Jun 25, 2026 15:545,64255,416,23643,952,0002,314,0002,117,632
6Jun 25, 2026 15:545,65756,083,50744,291,0002,098,0002,117,632
7Jun 25, 2026 15:545,65855,539,91344,358,0002,042,0002,117,632
8Jun 25, 2026 15:545,71056,012,67244,772,0002,051,0002,117,632
9Jun 25, 2026 15:545,74956,319,82445,122,0002,020,0002,117,632