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 23, 2024 10:49E SequeiraE SequeiraScore: 118,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 10:4993,312791,568,324650,133,000115,023,0002,322,432
2Nov 23, 2024 10:4999,858841,146,896698,859,000119,975,0002,322,432
3Nov 23, 2024 10:49101,137860,393,253707,421,000121,900,0002,310,144
4Nov 23, 2024 10:49113,626952,517,327800,770,000130,962,0002,379,776
5Nov 23, 2024 10:49118,9561,003,973,348853,507,000121,929,0002,428,928
6Nov 23, 2024 10:49118,988999,558,732844,745,000130,960,0002,310,144
7Nov 23, 2024 10:49121,9581,032,624,976884,167,000115,890,0002,306,048
8Nov 23, 2024 10:49128,8711,085,448,004931,776,000124,970,0002,486,272
9Nov 23, 2024 10:49137,7591,156,481,1061,012,662,000116,961,0002,363,392