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 listMar 12, 2025 20:20Aniruddha DebAniruddha DebScore: 967,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2025 20:20966,7957,957,091,3407,730,878,000196,844,0002,269,184
2Mar 12, 2025 20:20966,9657,963,112,8167,729,286,000199,826,0002,269,184
3Mar 12, 2025 20:20967,0457,958,629,1547,733,949,000195,821,0002,269,184
4Mar 12, 2025 20:20967,1367,970,615,6657,732,699,000197,813,0002,269,184
5Mar 12, 2025 20:20967,9857,964,343,4807,740,638,000196,838,0002,269,184
6Mar 12, 2025 20:20968,1107,965,103,2507,737,689,000200,810,0002,269,184
7Mar 12, 2025 20:20969,3717,974,331,0547,750,024,000198,821,0002,461,696
8Mar 12, 2025 20:20969,6917,983,634,3747,766,621,000184,848,0002,269,184
9Mar 12, 2025 20:20972,6988,007,670,5757,768,276,000207,846,0002,461,696