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 listApr 22, 2025 10:26NoSIMD_C#NoSIMD_C#Score: 747,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 10:26651,9715,370,429,1485,221,231,000124,933,0002,441,216
2Apr 22, 2025 10:26747,9426,166,830,7826,028,174,000104,950,0002,322,432
3Apr 22, 2025 10:261,056,6308,698,530,9608,546,440,000117,923,0002,297,856