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:10Zhou180Zhou180Score: 21,267Success
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:113,50038,013,80527,669,0001,032,0002,117,632
2Jun 26, 2026 08:113,51837,958,29927,804,0001,049,0002,117,632
3Jun 26, 2026 08:113,52738,041,77827,855,0001,071,0002,117,632
4Jun 26, 2026 08:113,52838,092,74027,887,0001,043,0002,117,632
5Jun 26, 2026 08:1121,267183,548,590172,380,0002,012,0002,117,632
6Jun 26, 2026 08:1121,759187,636,223176,410,0002,016,0002,117,632
7Jun 26, 2026 08:1122,204191,261,520180,070,0002,010,0002,117,632
8Jun 26, 2026 08:1122,214191,326,192180,148,0002,012,0002,117,632
9Jun 26, 2026 08:1122,322192,168,944181,036,0002,009,0002,117,632