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 listDec 4, 2024 12:34NoSIMD_C#NoSIMD_C#Score: 1,685,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2024 12:341,681,81713,825,297,75213,591,019,000199,882,0002,473,984
2Dec 4, 2024 12:341,685,98813,859,052,74813,633,228,000191,876,0002,506,752
3Dec 4, 2024 12:341,693,48114,020,247,81013,722,799,000163,747,0002,347,008