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 listMar 17, 2026 10:56limanjun99limanjun99Score: 964,669Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 10:56958,4357,894,382,5707,663,334,000195,829,0002,277,376
2Mar 17, 2026 10:56960,7817,912,750,5567,677,573,000200,831,0002,297,856
3Mar 17, 2026 10:56961,1847,913,989,9697,686,862,000194,844,0002,260,992
4Mar 17, 2026 10:56963,2777,927,993,7207,707,021,000191,851,0002,445,312
5Mar 17, 2026 10:56964,6697,944,887,4537,705,462,000204,826,0002,277,376
6Mar 17, 2026 10:56965,5717,958,857,4707,732,851,000184,829,0002,277,376
7Mar 17, 2026 10:56966,0377,950,806,6387,725,663,000195,839,0002,301,952
8Mar 17, 2026 10:56967,9297,968,813,1057,740,169,000196,851,0002,297,856
9Mar 17, 2026 10:56972,3888,003,979,8177,780,739,000192,844,0002,277,376