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:23NoSIMD_C#NoSIMD_C#Score: 1,637,494Success
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:231,620,16113,323,082,15413,111,434,000173,886,0002,412,544
2Nov 27, 2024 11:231,637,49413,463,732,94013,242,565,000184,882,0002,285,568
3Nov 27, 2024 11:231,650,06213,558,596,08613,349,620,000180,886,0002,392,064