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 listJan 23, 2025 08:33NoSIMD_C#NoSIMD_C#Score: 1,705,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:331,705,14214,010,733,50813,792,287,000189,880,0002,449,408
2Jan 23, 2025 08:331,705,33014,131,081,17513,795,005,000188,699,0002,297,856
3Jan 23, 2025 08:331,726,28214,298,238,25713,973,776,000181,736,0002,506,752