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 listFeb 28, 2026 15:07NoSIMD_C#NoSIMD_C#Score: 119,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 15:07100,883851,815,309641,414,000185,830,0002,338,816
2Feb 28, 2026 15:07119,6771,015,061,516780,482,000200,866,0002,437,120
3Feb 28, 2026 15:07140,3651,175,941,248952,170,000198,826,0002,449,408