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 listMar 4, 2026 14:38NoSIMD_C#NoSIMD_C#Score: 121,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 14:38119,9491,010,712,436824,650,000158,932,0002,400,256
2Mar 4, 2026 14:38121,3111,029,774,239822,796,000171,957,0002,371,584
3Mar 4, 2026 14:38134,6211,131,087,442934,066,000169,830,0002,473,984