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:58Zhou180Zhou180Score: 21,843Success
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:593,66339,165,79028,993,0001,049,0002,117,632
2Jun 26, 2026 08:593,75541,165,31228,767,0002,024,0002,117,632
3Jun 26, 2026 08:593,75739,930,50928,721,0002,092,0002,117,632
4Jun 26, 2026 08:5921,721187,252,614176,110,0002,010,0002,117,632
5Jun 26, 2026 08:5921,843188,268,421177,103,0002,011,0002,117,632
6Jun 26, 2026 08:5921,990189,461,164177,256,0003,062,0002,117,632
7Jun 26, 2026 08:5922,063190,151,136177,661,0003,259,0002,117,632
8Jun 26, 2026 08:5922,175190,982,721179,831,0002,011,0002,117,632
9Jun 26, 2026 08:5922,233191,421,231180,306,0002,012,0002,117,632