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 6, 2025 19:52Aniruddha DebAniruddha DebScore: 34,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 19:5230,391275,239,339235,193,00014,011,0002,338,816
2May 6, 2025 19:5231,500283,152,614235,274,00023,026,0002,355,200
3May 6, 2025 19:5231,737289,791,598235,218,00025,023,0002,428,928
4May 6, 2025 19:5233,919297,622,536248,118,00030,014,0002,351,104
5May 6, 2025 19:5234,847311,656,995260,766,00024,977,0002,330,624
6May 6, 2025 19:5235,421317,010,270258,404,00032,050,0002,400,256
7May 6, 2025 19:5235,642320,801,574265,237,00027,024,0002,457,600
8May 6, 2025 19:5235,687317,004,871255,683,00036,954,0002,379,776
9May 6, 2025 19:5239,806355,478,479296,465,00029,946,0002,387,968