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 06:40Zhou180Zhou180Score: 4,092Success
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 06:414,02242,172,16830,843,0002,138,0002,117,632
2Jun 26, 2026 06:414,03242,192,23430,870,0002,194,0002,117,632
3Jun 26, 2026 06:414,07742,640,98631,254,0002,180,0002,117,632
4Jun 26, 2026 06:414,09242,796,92231,320,0002,241,0002,117,632
5Jun 26, 2026 06:414,09242,700,15831,293,0002,262,0002,117,632
6Jun 26, 2026 06:414,11542,879,90531,406,0002,337,0002,117,632
7Jun 26, 2026 06:414,23243,835,10332,494,0002,211,0002,117,632
8Jun 26, 2026 06:414,25844,034,82132,896,0002,026,0002,117,632
9Jun 26, 2026 06:4122,678195,414,209182,521,0003,444,0002,117,632