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 listMay 3, 2026 15:47TudyMTudyMScore: 12,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 15:5612,606120,213,972102,352,0001,023,0002,465,792
2May 3, 2026 15:5612,631121,149,535102,561,0001,017,0002,478,080
3May 3, 2026 15:5612,634119,695,975102,586,0001,020,0002,420,736
4May 3, 2026 15:5612,651117,144,898102,720,0001,020,0002,461,696
5May 3, 2026 15:5612,658119,224,506102,779,0001,018,0002,338,816
6May 3, 2026 15:5612,697117,997,286103,096,0001,023,0002,531,328
7May 3, 2026 15:5612,701121,183,584102,118,0002,032,0002,392,064
8May 3, 2026 15:5612,787120,359,030103,843,0001,014,0002,486,272
9May 3, 2026 15:5613,345125,579,580107,217,0002,213,0002,306,048