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 listNov 4, 2026 19:25e1011e1011Score: 130,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 19:2699,987830,820,493678,245,000141,653,0002,113,536
2Nov 4, 2026 19:26103,945863,187,155710,678,000141,673,0002,113,536
3Nov 4, 2026 19:26115,176955,528,415804,047,000140,401,0002,113,536
4Nov 4, 2026 19:26123,9501,027,322,540874,863,000141,527,0002,113,536
5Nov 4, 2026 19:26130,4811,080,902,688928,588,000141,363,0002,113,536
6Nov 4, 2026 19:26132,3761,096,482,388946,228,000139,262,0002,113,536
7Nov 4, 2026 19:26142,5151,179,602,7251,027,403,000141,222,0002,113,536
8Nov 4, 2026 19:26143,3011,186,122,0931,033,586,000141,483,0002,113,536
9Nov 4, 2026 19:26151,6071,254,166,6721,103,317,000139,868,0002,113,536