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 27, 2024 11:00NoSIMD_C#NoSIMD_C#Score: 1,633,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 11:001,623,02213,341,042,11813,117,901,000190,882,0002,453,504
2Nov 27, 2024 11:001,633,95113,432,861,08513,201,537,000196,858,0002,396,160
3Nov 27, 2024 11:001,641,93613,498,925,57213,259,002,000204,876,0002,347,008