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 20:40e1011e1011Score: 191,874Success
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 20:42168,2793,054,873,369494,445,000885,450,0002,162,688
2Nov 4, 2026 20:42168,6803,507,941,154482,398,000900,786,0002,265,088
3Nov 4, 2026 20:42170,0953,115,874,215491,721,000903,063,0002,146,304
4Nov 4, 2026 20:42170,5423,322,064,154479,424,000919,028,0002,117,632
5Nov 4, 2026 20:42191,8744,561,334,636469,176,0001,104,196,0002,154,496
6Nov 4, 2026 20:42196,5924,522,190,900526,823,0001,085,239,0002,179,072
7Nov 4, 2026 20:42198,0944,812,752,937558,033,0001,066,344,0002,183,168
8Nov 4, 2026 20:42200,9934,698,559,511544,729,0001,103,414,0002,121,728
9Nov 4, 2026 20:42214,4595,729,879,929580,268,0001,178,298,0002,158,592